/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/safe032_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 16:26:16,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 16:26:16,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 16:26:16,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 16:26:16,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 16:26:16,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 16:26:16,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 16:26:16,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 16:26:16,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 16:26:16,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 16:26:16,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 16:26:16,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 16:26:16,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 16:26:16,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 16:26:16,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 16:26:16,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 16:26:16,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 16:26:16,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 16:26:16,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 16:26:16,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 16:26:16,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 16:26:16,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 16:26:16,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 16:26:16,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 16:26:16,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 16:26:16,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 16:26:16,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 16:26:16,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 16:26:16,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 16:26:16,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 16:26:16,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 16:26:16,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 16:26:16,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 16:26:16,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 16:26:16,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 16:26:16,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 16:26:16,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 16:26:16,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 16:26:16,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 16:26:16,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 16:26:16,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 16:26:16,268 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 16:26:16,303 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 16:26:16,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 16:26:16,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 16:26:16,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 16:26:16,307 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 16:26:16,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 16:26:16,307 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 16:26:16,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 16:26:16,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 16:26:16,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 16:26:16,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 16:26:16,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 16:26:16,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 16:26:16,309 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 16:26:16,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 16:26:16,309 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 16:26:16,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 16:26:16,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 16:26:16,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 16:26:16,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 16:26:16,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 16:26:16,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 16:26:16,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 16:26:16,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 16:26:16,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 16:26:16,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 16:26:16,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 16:26:16,311 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 16:26:16,311 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 16:26:16,311 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 16:26:16,311 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 16:26:16,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 16:26:16,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 16:26:16,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 16:26:16,695 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 16:26:16,696 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 16:26:16,697 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.opt.i [2021-06-11 16:26:16,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc7953fe9/84c8dba487794552b84bd67a0d8e6fb2/FLAGa5c1f2476 [2021-06-11 16:26:17,313 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 16:26:17,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.opt.i [2021-06-11 16:26:17,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc7953fe9/84c8dba487794552b84bd67a0d8e6fb2/FLAGa5c1f2476 [2021-06-11 16:26:17,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc7953fe9/84c8dba487794552b84bd67a0d8e6fb2 [2021-06-11 16:26:17,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 16:26:17,738 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 16:26:17,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 16:26:17,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 16:26:17,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 16:26:17,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:26:17" (1/1) ... [2021-06-11 16:26:17,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3d960e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:26:17, skipping insertion in model container [2021-06-11 16:26:17,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:26:17" (1/1) ... [2021-06-11 16:26:17,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 16:26:17,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 16:26:17,981 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/safe032_power.opt.i[994,1007] [2021-06-11 16:26:18,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:26:18,233 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 16:26:18,249 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/safe032_power.opt.i[994,1007] [2021-06-11 16:26:18,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:26:18,381 INFO L208 MainTranslator]: Completed translation [2021-06-11 16:26:18,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:26:18 WrapperNode [2021-06-11 16:26:18,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 16:26:18,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 16:26:18,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 16:26:18,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 16:26:18,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:26:18" (1/1) ... [2021-06-11 16:26:18,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:26:18" (1/1) ... [2021-06-11 16:26:18,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 16:26:18,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 16:26:18,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 16:26:18,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 16:26:18,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:26:18" (1/1) ... [2021-06-11 16:26:18,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:26:18" (1/1) ... [2021-06-11 16:26:18,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:26:18" (1/1) ... [2021-06-11 16:26:18,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:26:18" (1/1) ... [2021-06-11 16:26:18,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:26:18" (1/1) ... [2021-06-11 16:26:18,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:26:18" (1/1) ... [2021-06-11 16:26:18,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:26:18" (1/1) ... [2021-06-11 16:26:18,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 16:26:18,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 16:26:18,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 16:26:18,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 16:26:18,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:26:18" (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 16:26:18,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 16:26:18,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 16:26:18,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 16:26:18,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 16:26:18,596 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 16:26:18,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 16:26:18,597 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 16:26:18,597 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 16:26:18,597 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 16:26:18,597 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 16:26:18,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 16:26:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 16:26:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 16:26:18,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 16:26:18,600 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 16:26:21,557 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 16:26:21,558 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 16:26:21,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:26:21 BoogieIcfgContainer [2021-06-11 16:26:21,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 16:26:21,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 16:26:21,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 16:26:21,564 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 16:26:21,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 04:26:17" (1/3) ... [2021-06-11 16:26:21,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e36b5ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:26:21, skipping insertion in model container [2021-06-11 16:26:21,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:26:18" (2/3) ... [2021-06-11 16:26:21,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e36b5ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:26:21, skipping insertion in model container [2021-06-11 16:26:21,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:26:21" (3/3) ... [2021-06-11 16:26:21,566 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_power.opt.i [2021-06-11 16:26:21,572 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 16:26:21,576 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 16:26:21,577 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 16:26:21,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,625 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,641 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,642 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,642 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,642 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,667 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,667 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,667 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,667 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,668 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,668 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,668 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,668 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,675 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,675 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,675 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,683 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,684 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,689 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,690 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,692 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,692 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,692 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:26:21,693 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 16:26:21,708 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 16:26:21,735 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 16:26:21,735 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 16:26:21,735 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 16:26:21,735 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 16:26:21,735 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 16:26:21,735 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 16:26:21,735 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 16:26:21,735 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 16:26:21,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-06-11 16:26:21,789 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-06-11 16:26:21,790 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:26:21,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-06-11 16:26:21,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-06-11 16:26:21,809 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-06-11 16:26:21,811 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:21,821 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-06-11 16:26:21,824 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-06-11 16:26:21,828 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-06-11 16:26:21,856 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-06-11 16:26:21,859 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:26:21,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-06-11 16:26:21,864 INFO L151 LiptonReduction]: Number of co-enabled transitions 1668 [2021-06-11 16:26:21,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:21,960 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:21,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:21,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:21,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:26:22,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,424 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:22,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:22,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:26:22,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,696 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:22,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:22,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:26:22,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:22,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,920 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 16:26:22,920 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:26:22,944 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:22,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:23,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:23,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:23,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:23,407 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:23,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:23,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:23,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 16:26:23,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:23,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:23,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:23,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:23,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:23,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:23,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:23,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:23,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:23,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:23,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:23,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:23,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:23,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:23,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:23,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:24,091 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 16:26:24,515 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 16:26:24,647 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 16:26:24,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:24,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:24,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:24,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 16:26:24,666 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:24,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:24,668 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 16:26:24,668 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:26:24,671 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:24,673 INFO L147 QuantifierPusher]: treesize reduction 50, result has 50.0 percent of original size 50 [2021-06-11 16:26:24,674 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:24,676 INFO L142 QuantifierPusher]: treesize reduction 50, result has 68.8 percent of original size [2021-06-11 16:26:24,677 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 1] term [2021-06-11 16:26:24,677 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:26:24,678 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:24,680 INFO L147 QuantifierPusher]: treesize reduction 76, result has 39.7 percent of original size 50 [2021-06-11 16:26:24,681 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 3, 2, 1] term [2021-06-11 16:26:24,681 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:26:24,683 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:24,686 INFO L147 QuantifierPusher]: treesize reduction 141, result has 44.3 percent of original size 112 [2021-06-11 16:26:25,393 WARN L205 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-06-11 16:26:25,683 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-06-11 16:26:26,951 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2021-06-11 16:26:27,539 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-06-11 16:26:27,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:27,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:27,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:27,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:27,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:27,672 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:27,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:27,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:27,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:26:27,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:27,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:27,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:27,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:27,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:27,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:28,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:28,014 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:28,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:28,026 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:28,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:28,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:26:28,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 16:26:28,028 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:28,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:28,030 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:28,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:28,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-11 16:26:28,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 16:26:28,032 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:28,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:28,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 16:26:28,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-06-11 16:26:28,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:28,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:28,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:28,381 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 16:26:28,847 WARN L205 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-06-11 16:26:29,142 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-06-11 16:26:29,707 WARN L205 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-06-11 16:26:30,371 WARN L205 SmtUtils]: Spent 662.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-06-11 16:26:30,376 INFO L142 QuantifierPusher]: treesize reduction 16, result has 20.0 percent of original size [2021-06-11 16:26:30,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:30,674 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-06-11 16:26:30,978 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-06-11 16:26:31,583 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-06-11 16:26:32,176 WARN L205 SmtUtils]: Spent 592.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-06-11 16:26:32,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:32,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:32,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:32,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:32,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:32,356 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:32,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:32,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:32,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:26:32,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:32,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:32,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:32,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:33,403 WARN L205 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 200 [2021-06-11 16:26:33,799 WARN L205 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2021-06-11 16:26:34,424 WARN L205 SmtUtils]: Spent 623.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-06-11 16:26:35,099 WARN L205 SmtUtils]: Spent 673.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-06-11 16:26:35,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:35,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:35,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:35,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:35,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:35,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:35,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:35,484 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:35,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:35,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:35,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:26:35,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:35,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:36,183 WARN L205 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-06-11 16:26:36,606 WARN L205 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-06-11 16:26:37,463 WARN L205 SmtUtils]: Spent 855.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2021-06-11 16:26:38,378 WARN L205 SmtUtils]: Spent 914.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2021-06-11 16:26:38,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:38,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:38,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:38,566 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:38,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:38,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:38,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:26:38,939 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-06-11 16:26:39,085 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-11 16:26:39,396 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-06-11 16:26:39,540 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-11 16:26:39,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:39,550 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:26:39,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:39,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:39,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:26:39,620 INFO L163 LiptonReduction]: Checked pairs total: 4547 [2021-06-11 16:26:39,620 INFO L165 LiptonReduction]: Total number of compositions: 85 [2021-06-11 16:26:39,622 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17812 [2021-06-11 16:26:39,631 INFO L129 PetriNetUnfolder]: 1/15 cut-off events. [2021-06-11 16:26:39,631 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:26:39,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:39,632 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:39,632 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 16:26:39,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:39,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1451604129, now seen corresponding path program 1 times [2021-06-11 16:26:39,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:39,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328934022] [2021-06-11 16:26:39,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:39,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:39,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:26:39,870 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 16:26:39,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328934022] [2021-06-11 16:26:39,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:39,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:26:39,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011394243] [2021-06-11 16:26:39,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:26:39,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:39,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:26:39,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:26:39,890 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2021-06-11 16:26:39,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:39,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:39,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2021-06-11 16:26:39,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:40,100 INFO L129 PetriNetUnfolder]: 161/337 cut-off events. [2021-06-11 16:26:40,101 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:26:40,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 337 events. 161/337 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1704 event pairs, 33 based on Foata normal form. 23/331 useless extension candidates. Maximal degree in co-relation 595. Up to 193 conditions per place. [2021-06-11 16:26:40,105 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 13 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2021-06-11 16:26:40,105 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 103 flow [2021-06-11 16:26:40,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:26:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:26:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2021-06-11 16:26:40,124 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8296703296703297 [2021-06-11 16:26:40,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2021-06-11 16:26:40,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2021-06-11 16:26:40,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:40,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2021-06-11 16:26:40,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,145 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,147 INFO L185 Difference]: Start difference. First operand has 35 places, 27 transitions, 63 flow. Second operand 3 states and 453 transitions. [2021-06-11 16:26:40,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 103 flow [2021-06-11 16:26:40,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 16:26:40,151 INFO L241 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2021-06-11 16:26:40,152 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, 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 16:26:40,153 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-06-11 16:26:40,153 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:40,154 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 54 flow [2021-06-11 16:26:40,155 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 54 flow [2021-06-11 16:26:40,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2021-06-11 16:26:40,158 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-06-11 16:26:40,159 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:26:40,159 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 33 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 16:26:40,160 INFO L151 LiptonReduction]: Number of co-enabled transitions 234 [2021-06-11 16:26:40,216 INFO L163 LiptonReduction]: Checked pairs total: 268 [2021-06-11 16:26:40,216 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:40,216 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 63 [2021-06-11 16:26:40,218 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2021-06-11 16:26:40,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,219 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:40,219 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:40,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 16:26:40,219 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 16:26:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:40,227 INFO L82 PathProgramCache]: Analyzing trace with hash 872869630, now seen corresponding path program 1 times [2021-06-11 16:26:40,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:40,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596013098] [2021-06-11 16:26:40,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:40,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:40,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:26:40,394 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 16:26:40,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596013098] [2021-06-11 16:26:40,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:40,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:26:40,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423758834] [2021-06-11 16:26:40,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:26:40,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:40,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:26:40,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:26:40,401 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 182 [2021-06-11 16:26:40,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:40,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 182 [2021-06-11 16:26:40,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:40,417 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-06-11 16:26:40,418 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:26:40,418 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 32 events. 3/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 65 event pairs, 1 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 44. Up to 10 conditions per place. [2021-06-11 16:26:40,418 INFO L132 encePairwiseOnDemand]: 178/182 looper letters, 3 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2021-06-11 16:26:40,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 24 transitions, 70 flow [2021-06-11 16:26:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:26:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:26:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-06-11 16:26:40,420 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8424908424908425 [2021-06-11 16:26:40,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-06-11 16:26:40,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-06-11 16:26:40,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:40,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-06-11 16:26:40,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,425 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,425 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 460 transitions. [2021-06-11 16:26:40,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 24 transitions, 70 flow [2021-06-11 16:26:40,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 24 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:26:40,426 INFO L241 Difference]: Finished difference. Result has 32 places, 24 transitions, 69 flow [2021-06-11 16:26:40,426 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2021-06-11 16:26:40,427 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-06-11 16:26:40,427 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:40,427 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 24 transitions, 69 flow [2021-06-11 16:26:40,428 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 24 transitions, 69 flow [2021-06-11 16:26:40,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 24 transitions, 69 flow [2021-06-11 16:26:40,435 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-06-11 16:26:40,435 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:26:40,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 32 events. 3/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 69 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-06-11 16:26:40,438 INFO L151 LiptonReduction]: Number of co-enabled transitions 260 [2021-06-11 16:26:40,440 INFO L163 LiptonReduction]: Checked pairs total: 244 [2021-06-11 16:26:40,441 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:40,441 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-06-11 16:26:40,443 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 69 flow [2021-06-11 16:26:40,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,444 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:40,444 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:40,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 16:26:40,444 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 16:26:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:40,444 INFO L82 PathProgramCache]: Analyzing trace with hash 884328165, now seen corresponding path program 1 times [2021-06-11 16:26:40,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:40,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850210471] [2021-06-11 16:26:40,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:40,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:40,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:26:40,567 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 16:26:40,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850210471] [2021-06-11 16:26:40,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:40,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:26:40,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321226367] [2021-06-11 16:26:40,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:26:40,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:40,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:26:40,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:26:40,569 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 182 [2021-06-11 16:26:40,570 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,570 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:40,570 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 182 [2021-06-11 16:26:40,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:40,601 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-06-11 16:26:40,601 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-06-11 16:26:40,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 32 events. 3/32 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 1 based on Foata normal form. 2/32 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-06-11 16:26:40,602 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2021-06-11 16:26:40,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 75 flow [2021-06-11 16:26:40,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:26:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:26:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-06-11 16:26:40,605 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8424908424908425 [2021-06-11 16:26:40,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-06-11 16:26:40,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-06-11 16:26:40,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:40,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-06-11 16:26:40,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,609 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 69 flow. Second operand 3 states and 460 transitions. [2021-06-11 16:26:40,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 75 flow [2021-06-11 16:26:40,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 72 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 16:26:40,610 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 74 flow [2021-06-11 16:26:40,610 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2021-06-11 16:26:40,610 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2021-06-11 16:26:40,611 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:40,611 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 74 flow [2021-06-11 16:26:40,611 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 74 flow [2021-06-11 16:26:40,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 74 flow [2021-06-11 16:26:40,617 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-06-11 16:26:40,618 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-06-11 16:26:40,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-06-11 16:26:40,618 INFO L151 LiptonReduction]: Number of co-enabled transitions 254 [2021-06-11 16:26:40,620 INFO L163 LiptonReduction]: Checked pairs total: 210 [2021-06-11 16:26:40,620 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:40,620 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-06-11 16:26:40,621 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 74 flow [2021-06-11 16:26:40,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,622 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:40,622 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:40,622 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 16:26:40,622 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 16:26:40,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:40,622 INFO L82 PathProgramCache]: Analyzing trace with hash -380094159, now seen corresponding path program 1 times [2021-06-11 16:26:40,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:40,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560772179] [2021-06-11 16:26:40,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:40,728 INFO L142 QuantifierPusher]: treesize reduction 10, result has 68.8 percent of original size [2021-06-11 16:26:40,730 INFO L147 QuantifierPusher]: treesize reduction 5, result has 77.3 percent of original size 17 [2021-06-11 16:26:40,751 INFO L142 QuantifierPusher]: treesize reduction 10, result has 68.8 percent of original size [2021-06-11 16:26:40,752 INFO L147 QuantifierPusher]: treesize reduction 5, result has 77.3 percent of original size 17 [2021-06-11 16:26:40,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:40,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 16:26:40,764 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 16:26:40,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560772179] [2021-06-11 16:26:40,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:40,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:26:40,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142182541] [2021-06-11 16:26:40,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:26:40,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:40,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:26:40,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:26:40,768 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2021-06-11 16:26:40,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:40,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2021-06-11 16:26:40,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:40,932 INFO L129 PetriNetUnfolder]: 156/327 cut-off events. [2021-06-11 16:26:40,932 INFO L130 PetriNetUnfolder]: For 68/69 co-relation queries the response was YES. [2021-06-11 16:26:40,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 327 events. 156/327 cut-off events. For 68/69 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1602 event pairs, 13 based on Foata normal form. 4/316 useless extension candidates. Maximal degree in co-relation 672. Up to 178 conditions per place. [2021-06-11 16:26:40,936 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 17 selfloop transitions, 12 changer transitions 0/43 dead transitions. [2021-06-11 16:26:40,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 177 flow [2021-06-11 16:26:40,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:26:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:26:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2021-06-11 16:26:40,939 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7098901098901099 [2021-06-11 16:26:40,939 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2021-06-11 16:26:40,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2021-06-11 16:26:40,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:40,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2021-06-11 16:26:40,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,944 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:40,944 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 74 flow. Second operand 5 states and 646 transitions. [2021-06-11 16:26:40,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 177 flow [2021-06-11 16:26:40,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 171 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:26:40,947 INFO L241 Difference]: Finished difference. Result has 39 places, 34 transitions, 155 flow [2021-06-11 16:26:40,947 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2021-06-11 16:26:40,947 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2021-06-11 16:26:40,947 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:40,947 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 155 flow [2021-06-11 16:26:40,948 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 155 flow [2021-06-11 16:26:40,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 155 flow [2021-06-11 16:26:40,975 INFO L129 PetriNetUnfolder]: 65/165 cut-off events. [2021-06-11 16:26:40,976 INFO L130 PetriNetUnfolder]: For 164/174 co-relation queries the response was YES. [2021-06-11 16:26:40,976 INFO L84 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 165 events. 65/165 cut-off events. For 164/174 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 812 event pairs, 15 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 439. Up to 88 conditions per place. [2021-06-11 16:26:40,978 INFO L151 LiptonReduction]: Number of co-enabled transitions 356 [2021-06-11 16:26:41,218 INFO L163 LiptonReduction]: Checked pairs total: 72 [2021-06-11 16:26:41,218 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:41,218 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 271 [2021-06-11 16:26:41,219 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 155 flow [2021-06-11 16:26:41,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:41,219 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:41,219 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:41,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 16:26:41,220 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 16:26:41,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:41,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1101981809, now seen corresponding path program 1 times [2021-06-11 16:26:41,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:41,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083665243] [2021-06-11 16:26:41,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:41,370 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-06-11 16:26:41,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 16:26:41,406 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-06-11 16:26:41,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 16:26:41,410 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-06-11 16:26:41,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 16:26:41,448 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-06-11 16:26:41,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 16:26:41,473 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-06-11 16:26:41,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 16:26:41,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:41,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 16:26:41,519 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 16:26:41,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083665243] [2021-06-11 16:26:41,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:41,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 16:26:41,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576082104] [2021-06-11 16:26:41,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 16:26:41,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:41,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 16:26:41,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-11 16:26:41,522 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 182 [2021-06-11 16:26:41,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 155 flow. Second operand has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:41,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:41,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 182 [2021-06-11 16:26:41,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:41,802 INFO L129 PetriNetUnfolder]: 169/383 cut-off events. [2021-06-11 16:26:41,803 INFO L130 PetriNetUnfolder]: For 321/331 co-relation queries the response was YES. [2021-06-11 16:26:41,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 383 events. 169/383 cut-off events. For 321/331 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2128 event pairs, 32 based on Foata normal form. 18/387 useless extension candidates. Maximal degree in co-relation 1119. Up to 145 conditions per place. [2021-06-11 16:26:41,806 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 26 selfloop transitions, 13 changer transitions 4/57 dead transitions. [2021-06-11 16:26:41,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 352 flow [2021-06-11 16:26:41,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 16:26:41,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 16:26:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2021-06-11 16:26:41,809 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7005494505494505 [2021-06-11 16:26:41,809 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2021-06-11 16:26:41,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2021-06-11 16:26:41,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:41,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2021-06-11 16:26:41,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:41,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:41,814 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:41,814 INFO L185 Difference]: Start difference. First operand has 39 places, 34 transitions, 155 flow. Second operand 6 states and 765 transitions. [2021-06-11 16:26:41,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 57 transitions, 352 flow [2021-06-11 16:26:41,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 16:26:41,817 INFO L241 Difference]: Finished difference. Result has 47 places, 42 transitions, 252 flow [2021-06-11 16:26:41,817 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2021-06-11 16:26:41,818 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2021-06-11 16:26:41,818 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:41,818 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 252 flow [2021-06-11 16:26:41,818 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 252 flow [2021-06-11 16:26:41,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 252 flow [2021-06-11 16:26:41,846 INFO L129 PetriNetUnfolder]: 64/176 cut-off events. [2021-06-11 16:26:41,846 INFO L130 PetriNetUnfolder]: For 473/486 co-relation queries the response was YES. [2021-06-11 16:26:41,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 176 events. 64/176 cut-off events. For 473/486 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 866 event pairs, 16 based on Foata normal form. 1/174 useless extension candidates. Maximal degree in co-relation 556. Up to 85 conditions per place. [2021-06-11 16:26:41,849 INFO L151 LiptonReduction]: Number of co-enabled transitions 418 [2021-06-11 16:26:42,015 INFO L163 LiptonReduction]: Checked pairs total: 96 [2021-06-11 16:26:42,016 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:42,016 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 198 [2021-06-11 16:26:42,016 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 252 flow [2021-06-11 16:26:42,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:42,017 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:42,017 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:42,017 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 16:26:42,017 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 16:26:42,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:42,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1392954846, now seen corresponding path program 1 times [2021-06-11 16:26:42,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:42,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755929649] [2021-06-11 16:26:42,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:42,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:42,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:26:42,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:42,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 16:26:42,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:42,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 16:26:42,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:42,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 16:26:42,172 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 16:26:42,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755929649] [2021-06-11 16:26:42,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:42,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:26:42,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174098887] [2021-06-11 16:26:42,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:26:42,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:42,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:26:42,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:26:42,174 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2021-06-11 16:26:42,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:42,175 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:42,175 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2021-06-11 16:26:42,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:42,421 INFO L129 PetriNetUnfolder]: 174/387 cut-off events. [2021-06-11 16:26:42,422 INFO L130 PetriNetUnfolder]: For 849/867 co-relation queries the response was YES. [2021-06-11 16:26:42,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 387 events. 174/387 cut-off events. For 849/867 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2160 event pairs, 15 based on Foata normal form. 20/401 useless extension candidates. Maximal degree in co-relation 1305. Up to 200 conditions per place. [2021-06-11 16:26:42,425 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 22 selfloop transitions, 21 changer transitions 0/57 dead transitions. [2021-06-11 16:26:42,426 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 425 flow [2021-06-11 16:26:42,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 16:26:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 16:26:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions. [2021-06-11 16:26:42,429 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7014652014652014 [2021-06-11 16:26:42,429 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 766 transitions. [2021-06-11 16:26:42,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 766 transitions. [2021-06-11 16:26:42,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:42,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 766 transitions. [2021-06-11 16:26:42,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:42,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:42,433 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:42,433 INFO L185 Difference]: Start difference. First operand has 47 places, 42 transitions, 252 flow. Second operand 6 states and 766 transitions. [2021-06-11 16:26:42,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 425 flow [2021-06-11 16:26:42,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 410 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 16:26:42,437 INFO L241 Difference]: Finished difference. Result has 53 places, 52 transitions, 398 flow [2021-06-11 16:26:42,438 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2021-06-11 16:26:42,438 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2021-06-11 16:26:42,438 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:42,438 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 52 transitions, 398 flow [2021-06-11 16:26:42,438 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 52 transitions, 398 flow [2021-06-11 16:26:42,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 52 transitions, 398 flow [2021-06-11 16:26:42,466 INFO L129 PetriNetUnfolder]: 64/180 cut-off events. [2021-06-11 16:26:42,466 INFO L130 PetriNetUnfolder]: For 416/429 co-relation queries the response was YES. [2021-06-11 16:26:42,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 180 events. 64/180 cut-off events. For 416/429 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 925 event pairs, 9 based on Foata normal form. 4/175 useless extension candidates. Maximal degree in co-relation 669. Up to 89 conditions per place. [2021-06-11 16:26:42,468 INFO L151 LiptonReduction]: Number of co-enabled transitions 504 [2021-06-11 16:26:42,688 INFO L163 LiptonReduction]: Checked pairs total: 126 [2021-06-11 16:26:42,688 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:42,688 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 250 [2021-06-11 16:26:42,689 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 398 flow [2021-06-11 16:26:42,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:42,689 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:42,689 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:42,689 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 16:26:42,689 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 16:26:42,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:42,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2101279520, now seen corresponding path program 1 times [2021-06-11 16:26:42,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:42,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641840310] [2021-06-11 16:26:42,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:42,799 INFO L142 QuantifierPusher]: treesize reduction 14, result has 56.3 percent of original size [2021-06-11 16:26:42,800 INFO L147 QuantifierPusher]: treesize reduction 4, result has 77.8 percent of original size 14 [2021-06-11 16:26:42,818 INFO L142 QuantifierPusher]: treesize reduction 13, result has 62.9 percent of original size [2021-06-11 16:26:42,818 INFO L147 QuantifierPusher]: treesize reduction 5, result has 77.3 percent of original size 17 [2021-06-11 16:26:42,843 INFO L142 QuantifierPusher]: treesize reduction 18, result has 50.0 percent of original size [2021-06-11 16:26:42,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 16:26:42,861 INFO L142 QuantifierPusher]: treesize reduction 18, result has 53.8 percent of original size [2021-06-11 16:26:42,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 16:26:42,879 INFO L142 QuantifierPusher]: treesize reduction 5, result has 83.9 percent of original size [2021-06-11 16:26:42,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-06-11 16:26:42,914 INFO L142 QuantifierPusher]: treesize reduction 3, result has 90.3 percent of original size [2021-06-11 16:26:42,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 16:26:42,940 INFO L142 QuantifierPusher]: treesize reduction 3, result has 90.3 percent of original size [2021-06-11 16:26:42,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 16:26:42,964 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 16:26:42,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641840310] [2021-06-11 16:26:42,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:42,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 16:26:42,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945665261] [2021-06-11 16:26:42,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 16:26:42,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:42,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 16:26:42,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-06-11 16:26:42,967 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2021-06-11 16:26:42,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 398 flow. Second operand has 9 states, 9 states have (on average 123.88888888888889) internal successors, (1115), 9 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:42,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:42,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2021-06-11 16:26:42,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:43,235 INFO L129 PetriNetUnfolder]: 188/414 cut-off events. [2021-06-11 16:26:43,235 INFO L130 PetriNetUnfolder]: For 1267/1332 co-relation queries the response was YES. [2021-06-11 16:26:43,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 414 events. 188/414 cut-off events. For 1267/1332 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2339 event pairs, 8 based on Foata normal form. 41/444 useless extension candidates. Maximal degree in co-relation 1644. Up to 231 conditions per place. [2021-06-11 16:26:43,239 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 25 selfloop transitions, 27 changer transitions 0/66 dead transitions. [2021-06-11 16:26:43,239 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 614 flow [2021-06-11 16:26:43,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:26:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:26:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 643 transitions. [2021-06-11 16:26:43,241 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7065934065934066 [2021-06-11 16:26:43,241 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 643 transitions. [2021-06-11 16:26:43,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 643 transitions. [2021-06-11 16:26:43,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:43,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 643 transitions. [2021-06-11 16:26:43,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.6) internal successors, (643), 5 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 16:26:43,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:43,245 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:43,245 INFO L185 Difference]: Start difference. First operand has 53 places, 52 transitions, 398 flow. Second operand 5 states and 643 transitions. [2021-06-11 16:26:43,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 614 flow [2021-06-11 16:26:43,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 583 flow, removed 15 selfloop flow, removed 1 redundant places. [2021-06-11 16:26:43,250 INFO L241 Difference]: Finished difference. Result has 58 places, 60 transitions, 547 flow [2021-06-11 16:26:43,250 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=547, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2021-06-11 16:26:43,250 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2021-06-11 16:26:43,251 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:43,251 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 60 transitions, 547 flow [2021-06-11 16:26:43,251 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 60 transitions, 547 flow [2021-06-11 16:26:43,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 547 flow [2021-06-11 16:26:43,283 INFO L129 PetriNetUnfolder]: 73/194 cut-off events. [2021-06-11 16:26:43,283 INFO L130 PetriNetUnfolder]: For 676/696 co-relation queries the response was YES. [2021-06-11 16:26:43,284 INFO L84 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 194 events. 73/194 cut-off events. For 676/696 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 978 event pairs, 5 based on Foata normal form. 7/191 useless extension candidates. Maximal degree in co-relation 827. Up to 99 conditions per place. [2021-06-11 16:26:43,286 INFO L151 LiptonReduction]: Number of co-enabled transitions 586 [2021-06-11 16:26:43,293 INFO L163 LiptonReduction]: Checked pairs total: 150 [2021-06-11 16:26:43,293 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:43,293 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-06-11 16:26:43,293 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 547 flow [2021-06-11 16:26:43,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 123.88888888888889) internal successors, (1115), 9 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:43,294 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:43,294 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:43,294 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 16:26:43,294 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 16:26:43,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:43,295 INFO L82 PathProgramCache]: Analyzing trace with hash -274827456, now seen corresponding path program 1 times [2021-06-11 16:26:43,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:43,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340354718] [2021-06-11 16:26:43,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:43,404 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-06-11 16:26:43,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 16:26:43,435 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-06-11 16:26:43,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 16:26:43,439 INFO L142 QuantifierPusher]: treesize reduction 14, result has 77.4 percent of original size [2021-06-11 16:26:43,440 INFO L147 QuantifierPusher]: treesize reduction 8, result has 83.3 percent of original size 40 [2021-06-11 16:26:43,481 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.9 percent of original size [2021-06-11 16:26:43,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-06-11 16:26:43,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:43,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-11 16:26:43,523 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 16:26:43,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340354718] [2021-06-11 16:26:43,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:43,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:26:43,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142489625] [2021-06-11 16:26:43,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:26:43,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:43,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:26:43,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:26:43,526 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 182 [2021-06-11 16:26:43,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 547 flow. Second operand has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:43,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:43,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 182 [2021-06-11 16:26:43,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:43,859 INFO L129 PetriNetUnfolder]: 201/442 cut-off events. [2021-06-11 16:26:43,860 INFO L130 PetriNetUnfolder]: For 1653/1718 co-relation queries the response was YES. [2021-06-11 16:26:43,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1976 conditions, 442 events. 201/442 cut-off events. For 1653/1718 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2538 event pairs, 10 based on Foata normal form. 45/479 useless extension candidates. Maximal degree in co-relation 1950. Up to 262 conditions per place. [2021-06-11 16:26:43,865 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 36 selfloop transitions, 37 changer transitions 0/87 dead transitions. [2021-06-11 16:26:43,865 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 87 transitions, 932 flow [2021-06-11 16:26:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 16:26:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 16:26:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2021-06-11 16:26:43,869 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6930926216640503 [2021-06-11 16:26:43,869 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2021-06-11 16:26:43,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2021-06-11 16:26:43,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:43,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2021-06-11 16:26:43,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:43,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:43,874 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:43,874 INFO L185 Difference]: Start difference. First operand has 58 places, 60 transitions, 547 flow. Second operand 7 states and 883 transitions. [2021-06-11 16:26:43,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 87 transitions, 932 flow [2021-06-11 16:26:43,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 87 transitions, 884 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-06-11 16:26:43,882 INFO L241 Difference]: Finished difference. Result has 66 places, 82 transitions, 851 flow [2021-06-11 16:26:43,882 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=851, PETRI_PLACES=66, PETRI_TRANSITIONS=82} [2021-06-11 16:26:43,882 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 31 predicate places. [2021-06-11 16:26:43,882 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:43,882 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 82 transitions, 851 flow [2021-06-11 16:26:43,883 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 82 transitions, 851 flow [2021-06-11 16:26:43,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 82 transitions, 851 flow [2021-06-11 16:26:44,016 INFO L129 PetriNetUnfolder]: 148/366 cut-off events. [2021-06-11 16:26:44,017 INFO L130 PetriNetUnfolder]: For 1739/1815 co-relation queries the response was YES. [2021-06-11 16:26:44,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 366 events. 148/366 cut-off events. For 1739/1815 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2236 event pairs, 6 based on Foata normal form. 23/376 useless extension candidates. Maximal degree in co-relation 1705. Up to 180 conditions per place. [2021-06-11 16:26:44,023 INFO L151 LiptonReduction]: Number of co-enabled transitions 682 [2021-06-11 16:26:44,038 INFO L163 LiptonReduction]: Checked pairs total: 171 [2021-06-11 16:26:44,038 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:44,038 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 156 [2021-06-11 16:26:44,039 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 82 transitions, 851 flow [2021-06-11 16:26:44,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:44,039 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:44,040 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:44,040 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 16:26:44,040 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 16:26:44,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:44,040 INFO L82 PathProgramCache]: Analyzing trace with hash -274846738, now seen corresponding path program 2 times [2021-06-11 16:26:44,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:44,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840878593] [2021-06-11 16:26:44,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:44,213 INFO L142 QuantifierPusher]: treesize reduction 47, result has 29.9 percent of original size [2021-06-11 16:26:44,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 16:26:44,229 INFO L142 QuantifierPusher]: treesize reduction 47, result has 29.9 percent of original size [2021-06-11 16:26:44,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 16:26:44,233 INFO L142 QuantifierPusher]: treesize reduction 36, result has 66.0 percent of original size [2021-06-11 16:26:44,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-06-11 16:26:44,242 INFO L142 QuantifierPusher]: treesize reduction 43, result has 67.2 percent of original size [2021-06-11 16:26:44,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2021-06-11 16:26:44,301 INFO L142 QuantifierPusher]: treesize reduction 43, result has 67.9 percent of original size [2021-06-11 16:26:44,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 91 [2021-06-11 16:26:44,356 INFO L142 QuantifierPusher]: treesize reduction 3, result has 86.4 percent of original size [2021-06-11 16:26:44,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 16:26:44,372 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 16:26:44,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840878593] [2021-06-11 16:26:44,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:44,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:26:44,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891215543] [2021-06-11 16:26:44,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:26:44,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:44,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:26:44,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:26:44,374 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 182 [2021-06-11 16:26:44,375 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 82 transitions, 851 flow. Second operand has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:44,375 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:44,375 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 182 [2021-06-11 16:26:44,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:44,792 INFO L129 PetriNetUnfolder]: 211/461 cut-off events. [2021-06-11 16:26:44,792 INFO L130 PetriNetUnfolder]: For 2175/2289 co-relation queries the response was YES. [2021-06-11 16:26:44,795 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2355 conditions, 461 events. 211/461 cut-off events. For 2175/2289 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2678 event pairs, 8 based on Foata normal form. 73/523 useless extension candidates. Maximal degree in co-relation 2325. Up to 251 conditions per place. [2021-06-11 16:26:44,798 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 43 selfloop transitions, 45 changer transitions 0/102 dead transitions. [2021-06-11 16:26:44,798 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 102 transitions, 1217 flow [2021-06-11 16:26:44,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 16:26:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 16:26:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1003 transitions. [2021-06-11 16:26:44,802 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6888736263736264 [2021-06-11 16:26:44,802 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1003 transitions. [2021-06-11 16:26:44,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1003 transitions. [2021-06-11 16:26:44,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:44,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1003 transitions. [2021-06-11 16:26:44,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.375) internal successors, (1003), 8 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:44,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:44,807 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:44,807 INFO L185 Difference]: Start difference. First operand has 66 places, 82 transitions, 851 flow. Second operand 8 states and 1003 transitions. [2021-06-11 16:26:44,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 102 transitions, 1217 flow [2021-06-11 16:26:44,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 102 transitions, 1183 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-06-11 16:26:44,817 INFO L241 Difference]: Finished difference. Result has 75 places, 94 transitions, 1115 flow [2021-06-11 16:26:44,817 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1115, PETRI_PLACES=75, PETRI_TRANSITIONS=94} [2021-06-11 16:26:44,817 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 40 predicate places. [2021-06-11 16:26:44,817 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:44,818 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 94 transitions, 1115 flow [2021-06-11 16:26:44,818 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 94 transitions, 1115 flow [2021-06-11 16:26:44,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 94 transitions, 1115 flow [2021-06-11 16:26:44,889 INFO L129 PetriNetUnfolder]: 164/410 cut-off events. [2021-06-11 16:26:44,890 INFO L130 PetriNetUnfolder]: For 2561/2682 co-relation queries the response was YES. [2021-06-11 16:26:44,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2125 conditions, 410 events. 164/410 cut-off events. For 2561/2682 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2493 event pairs, 7 based on Foata normal form. 80/482 useless extension candidates. Maximal degree in co-relation 2093. Up to 195 conditions per place. [2021-06-11 16:26:44,896 INFO L151 LiptonReduction]: Number of co-enabled transitions 770 [2021-06-11 16:26:44,914 INFO L163 LiptonReduction]: Checked pairs total: 260 [2021-06-11 16:26:44,915 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:44,915 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 98 [2021-06-11 16:26:44,915 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 94 transitions, 1115 flow [2021-06-11 16:26:44,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:44,916 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:44,916 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:44,916 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 16:26:44,916 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 16:26:44,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:44,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2021841626, now seen corresponding path program 2 times [2021-06-11 16:26:44,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:44,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214682943] [2021-06-11 16:26:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:45,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:45,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:26:45,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:45,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:45,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:45,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 16:26:45,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:45,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 16:26:45,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:45,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 16:26:45,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:45,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 16:26:45,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:45,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 16:26:45,097 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 16:26:45,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214682943] [2021-06-11 16:26:45,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:45,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 16:26:45,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866416767] [2021-06-11 16:26:45,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 16:26:45,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:45,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 16:26:45,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-06-11 16:26:45,102 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 182 [2021-06-11 16:26:45,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 94 transitions, 1115 flow. Second operand has 8 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:45,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:45,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 182 [2021-06-11 16:26:45,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:45,437 INFO L129 PetriNetUnfolder]: 228/492 cut-off events. [2021-06-11 16:26:45,437 INFO L130 PetriNetUnfolder]: For 3033/3160 co-relation queries the response was YES. [2021-06-11 16:26:45,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2790 conditions, 492 events. 228/492 cut-off events. For 3033/3160 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2907 event pairs, 3 based on Foata normal form. 99/578 useless extension candidates. Maximal degree in co-relation 2756. Up to 258 conditions per place. [2021-06-11 16:26:45,444 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 38 selfloop transitions, 60 changer transitions 0/112 dead transitions. [2021-06-11 16:26:45,444 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 112 transitions, 1473 flow [2021-06-11 16:26:45,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 16:26:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 16:26:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 878 transitions. [2021-06-11 16:26:45,448 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6891679748822606 [2021-06-11 16:26:45,448 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 878 transitions. [2021-06-11 16:26:45,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 878 transitions. [2021-06-11 16:26:45,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:45,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 878 transitions. [2021-06-11 16:26:45,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:45,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:45,453 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:45,453 INFO L185 Difference]: Start difference. First operand has 75 places, 94 transitions, 1115 flow. Second operand 7 states and 878 transitions. [2021-06-11 16:26:45,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 112 transitions, 1473 flow [2021-06-11 16:26:45,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 112 transitions, 1409 flow, removed 18 selfloop flow, removed 2 redundant places. [2021-06-11 16:26:45,465 INFO L241 Difference]: Finished difference. Result has 82 places, 105 transitions, 1365 flow [2021-06-11 16:26:45,466 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1365, PETRI_PLACES=82, PETRI_TRANSITIONS=105} [2021-06-11 16:26:45,466 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 47 predicate places. [2021-06-11 16:26:45,466 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:45,466 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 105 transitions, 1365 flow [2021-06-11 16:26:45,466 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 105 transitions, 1365 flow [2021-06-11 16:26:45,467 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 105 transitions, 1365 flow [2021-06-11 16:26:45,542 INFO L129 PetriNetUnfolder]: 175/431 cut-off events. [2021-06-11 16:26:45,542 INFO L130 PetriNetUnfolder]: For 3542/3673 co-relation queries the response was YES. [2021-06-11 16:26:45,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 431 events. 175/431 cut-off events. For 3542/3673 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2678 event pairs, 6 based on Foata normal form. 81/503 useless extension candidates. Maximal degree in co-relation 2406. Up to 191 conditions per place. [2021-06-11 16:26:45,550 INFO L151 LiptonReduction]: Number of co-enabled transitions 872 [2021-06-11 16:26:45,573 INFO L163 LiptonReduction]: Checked pairs total: 300 [2021-06-11 16:26:45,574 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:45,574 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 108 [2021-06-11 16:26:45,575 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 105 transitions, 1365 flow [2021-06-11 16:26:45,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:45,576 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:45,576 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:45,576 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 16:26:45,576 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 16:26:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:45,576 INFO L82 PathProgramCache]: Analyzing trace with hash -972180418, now seen corresponding path program 3 times [2021-06-11 16:26:45,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:45,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957132061] [2021-06-11 16:26:45,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:45,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:45,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 16:26:45,670 INFO L142 QuantifierPusher]: treesize reduction 49, result has 62.0 percent of original size [2021-06-11 16:26:45,671 INFO L147 QuantifierPusher]: treesize reduction 9, result has 88.8 percent of original size 71 [2021-06-11 16:26:45,759 INFO L142 QuantifierPusher]: treesize reduction 45, result has 73.2 percent of original size [2021-06-11 16:26:45,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 123 [2021-06-11 16:26:45,815 INFO L142 QuantifierPusher]: treesize reduction 45, result has 74.0 percent of original size [2021-06-11 16:26:45,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 128 [2021-06-11 16:26:45,874 INFO L142 QuantifierPusher]: treesize reduction 45, result has 74.4 percent of original size [2021-06-11 16:26:45,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 131 [2021-06-11 16:26:45,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:45,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:26:45,951 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 16:26:45,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957132061] [2021-06-11 16:26:45,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:45,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 16:26:45,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813019579] [2021-06-11 16:26:45,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 16:26:45,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:45,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 16:26:45,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-11 16:26:45,953 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 182 [2021-06-11 16:26:45,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 105 transitions, 1365 flow. Second operand has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:45,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:45,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 182 [2021-06-11 16:26:45,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:46,272 INFO L129 PetriNetUnfolder]: 230/500 cut-off events. [2021-06-11 16:26:46,272 INFO L130 PetriNetUnfolder]: For 4149/4282 co-relation queries the response was YES. [2021-06-11 16:26:46,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3030 conditions, 500 events. 230/500 cut-off events. For 4149/4282 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2927 event pairs, 8 based on Foata normal form. 70/556 useless extension candidates. Maximal degree in co-relation 2992. Up to 303 conditions per place. [2021-06-11 16:26:46,279 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 62 selfloop transitions, 39 changer transitions 0/115 dead transitions. [2021-06-11 16:26:46,279 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 115 transitions, 1668 flow [2021-06-11 16:26:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 16:26:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 16:26:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions. [2021-06-11 16:26:46,283 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2021-06-11 16:26:46,283 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 735 transitions. [2021-06-11 16:26:46,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions. [2021-06-11 16:26:46,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:46,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions. [2021-06-11 16:26:46,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:46,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:46,287 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:46,287 INFO L185 Difference]: Start difference. First operand has 82 places, 105 transitions, 1365 flow. Second operand 6 states and 735 transitions. [2021-06-11 16:26:46,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 115 transitions, 1668 flow [2021-06-11 16:26:46,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 115 transitions, 1596 flow, removed 23 selfloop flow, removed 2 redundant places. [2021-06-11 16:26:46,309 INFO L241 Difference]: Finished difference. Result has 86 places, 110 transitions, 1473 flow [2021-06-11 16:26:46,310 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1473, PETRI_PLACES=86, PETRI_TRANSITIONS=110} [2021-06-11 16:26:46,310 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2021-06-11 16:26:46,310 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:46,310 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 110 transitions, 1473 flow [2021-06-11 16:26:46,310 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 110 transitions, 1473 flow [2021-06-11 16:26:46,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 110 transitions, 1473 flow [2021-06-11 16:26:46,385 INFO L129 PetriNetUnfolder]: 174/427 cut-off events. [2021-06-11 16:26:46,385 INFO L130 PetriNetUnfolder]: For 4430/4551 co-relation queries the response was YES. [2021-06-11 16:26:46,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 427 events. 174/427 cut-off events. For 4430/4551 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2707 event pairs, 8 based on Foata normal form. 78/488 useless extension candidates. Maximal degree in co-relation 2537. Up to 179 conditions per place. [2021-06-11 16:26:46,393 INFO L151 LiptonReduction]: Number of co-enabled transitions 896 [2021-06-11 16:26:46,426 INFO L163 LiptonReduction]: Checked pairs total: 304 [2021-06-11 16:26:46,426 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:46,426 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 116 [2021-06-11 16:26:46,429 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 110 transitions, 1473 flow [2021-06-11 16:26:46,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:46,430 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:46,430 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:46,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 16:26:46,430 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 16:26:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:46,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2084699642, now seen corresponding path program 4 times [2021-06-11 16:26:46,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:46,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849815650] [2021-06-11 16:26:46,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:46,526 INFO L142 QuantifierPusher]: treesize reduction 30, result has 42.3 percent of original size [2021-06-11 16:26:46,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 16:26:46,540 INFO L142 QuantifierPusher]: treesize reduction 30, result has 45.5 percent of original size [2021-06-11 16:26:46,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 16:26:46,558 INFO L142 QuantifierPusher]: treesize reduction 30, result has 42.3 percent of original size [2021-06-11 16:26:46,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 16:26:46,575 INFO L142 QuantifierPusher]: treesize reduction 9, result has 76.3 percent of original size [2021-06-11 16:26:46,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-11 16:26:46,611 INFO L142 QuantifierPusher]: treesize reduction 16, result has 72.9 percent of original size [2021-06-11 16:26:46,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-06-11 16:26:46,664 INFO L142 QuantifierPusher]: treesize reduction 26, result has 65.8 percent of original size [2021-06-11 16:26:46,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 16:26:46,716 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.7 percent of original size [2021-06-11 16:26:46,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 16:26:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:26:46,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849815650] [2021-06-11 16:26:46,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:46,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 16:26:46,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571785541] [2021-06-11 16:26:46,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 16:26:46,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:46,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 16:26:46,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-11 16:26:46,738 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 182 [2021-06-11 16:26:46,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 110 transitions, 1473 flow. Second operand has 9 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:46,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:46,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 182 [2021-06-11 16:26:46,740 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:47,236 INFO L129 PetriNetUnfolder]: 243/521 cut-off events. [2021-06-11 16:26:47,237 INFO L130 PetriNetUnfolder]: For 5454/5632 co-relation queries the response was YES. [2021-06-11 16:26:47,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3289 conditions, 521 events. 243/521 cut-off events. For 5454/5632 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3103 event pairs, 9 based on Foata normal form. 123/627 useless extension candidates. Maximal degree in co-relation 3249. Up to 276 conditions per place. [2021-06-11 16:26:47,244 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 48 selfloop transitions, 61 changer transitions 0/123 dead transitions. [2021-06-11 16:26:47,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 123 transitions, 1839 flow [2021-06-11 16:26:47,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 16:26:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 16:26:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 950 transitions. [2021-06-11 16:26:47,248 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6524725274725275 [2021-06-11 16:26:47,248 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 950 transitions. [2021-06-11 16:26:47,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 950 transitions. [2021-06-11 16:26:47,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:47,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 950 transitions. [2021-06-11 16:26:47,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:47,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:47,254 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:47,254 INFO L185 Difference]: Start difference. First operand has 86 places, 110 transitions, 1473 flow. Second operand 8 states and 950 transitions. [2021-06-11 16:26:47,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 123 transitions, 1839 flow [2021-06-11 16:26:47,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 123 transitions, 1789 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-06-11 16:26:47,273 INFO L241 Difference]: Finished difference. Result has 91 places, 115 transitions, 1657 flow [2021-06-11 16:26:47,273 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1657, PETRI_PLACES=91, PETRI_TRANSITIONS=115} [2021-06-11 16:26:47,274 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 56 predicate places. [2021-06-11 16:26:47,274 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:47,274 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 115 transitions, 1657 flow [2021-06-11 16:26:47,274 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 115 transitions, 1657 flow [2021-06-11 16:26:47,275 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 115 transitions, 1657 flow [2021-06-11 16:26:47,351 INFO L129 PetriNetUnfolder]: 176/434 cut-off events. [2021-06-11 16:26:47,351 INFO L130 PetriNetUnfolder]: For 5247/5356 co-relation queries the response was YES. [2021-06-11 16:26:47,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2759 conditions, 434 events. 176/434 cut-off events. For 5247/5356 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2697 event pairs, 10 based on Foata normal form. 60/476 useless extension candidates. Maximal degree in co-relation 2719. Up to 184 conditions per place. [2021-06-11 16:26:47,361 INFO L151 LiptonReduction]: Number of co-enabled transitions 948 [2021-06-11 16:26:47,375 INFO L163 LiptonReduction]: Checked pairs total: 324 [2021-06-11 16:26:47,376 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:47,376 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 102 [2021-06-11 16:26:47,376 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 115 transitions, 1657 flow [2021-06-11 16:26:47,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:47,377 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:47,377 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:47,377 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 16:26:47,377 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 16:26:47,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:47,378 INFO L82 PathProgramCache]: Analyzing trace with hash -415469272, now seen corresponding path program 3 times [2021-06-11 16:26:47,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:47,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104712763] [2021-06-11 16:26:47,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:47,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:47,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:26:47,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:47,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:26:47,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:47,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:47,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:47,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 16:26:47,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:47,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 16:26:47,510 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 16:26:47,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104712763] [2021-06-11 16:26:47,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:47,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:26:47,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126863402] [2021-06-11 16:26:47,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:26:47,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:47,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:26:47,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:26:47,512 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 182 [2021-06-11 16:26:47,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 115 transitions, 1657 flow. Second operand has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:47,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:47,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 182 [2021-06-11 16:26:47,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:47,877 INFO L129 PetriNetUnfolder]: 243/529 cut-off events. [2021-06-11 16:26:47,878 INFO L130 PetriNetUnfolder]: For 6151/6298 co-relation queries the response was YES. [2021-06-11 16:26:47,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3447 conditions, 529 events. 243/529 cut-off events. For 6151/6298 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3196 event pairs, 4 based on Foata normal form. 90/604 useless extension candidates. Maximal degree in co-relation 3405. Up to 270 conditions per place. [2021-06-11 16:26:47,887 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 49 selfloop transitions, 65 changer transitions 0/128 dead transitions. [2021-06-11 16:26:47,887 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 128 transitions, 2007 flow [2021-06-11 16:26:47,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 16:26:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 16:26:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1011 transitions. [2021-06-11 16:26:47,891 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6943681318681318 [2021-06-11 16:26:47,891 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1011 transitions. [2021-06-11 16:26:47,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1011 transitions. [2021-06-11 16:26:47,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:47,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1011 transitions. [2021-06-11 16:26:47,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.375) internal successors, (1011), 8 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:47,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:47,896 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:47,896 INFO L185 Difference]: Start difference. First operand has 91 places, 115 transitions, 1657 flow. Second operand 8 states and 1011 transitions. [2021-06-11 16:26:47,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 128 transitions, 2007 flow [2021-06-11 16:26:47,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 128 transitions, 1863 flow, removed 22 selfloop flow, removed 5 redundant places. [2021-06-11 16:26:47,916 INFO L241 Difference]: Finished difference. Result has 94 places, 121 transitions, 1748 flow [2021-06-11 16:26:47,916 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1748, PETRI_PLACES=94, PETRI_TRANSITIONS=121} [2021-06-11 16:26:47,917 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 59 predicate places. [2021-06-11 16:26:47,917 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:47,917 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 121 transitions, 1748 flow [2021-06-11 16:26:47,917 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 121 transitions, 1748 flow [2021-06-11 16:26:47,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 94 places, 121 transitions, 1748 flow [2021-06-11 16:26:47,993 INFO L129 PetriNetUnfolder]: 184/468 cut-off events. [2021-06-11 16:26:47,993 INFO L130 PetriNetUnfolder]: For 4756/4825 co-relation queries the response was YES. [2021-06-11 16:26:47,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2891 conditions, 468 events. 184/468 cut-off events. For 4756/4825 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3008 event pairs, 4 based on Foata normal form. 36/496 useless extension candidates. Maximal degree in co-relation 2850. Up to 168 conditions per place. [2021-06-11 16:26:48,003 INFO L151 LiptonReduction]: Number of co-enabled transitions 996 [2021-06-11 16:26:48,017 INFO L163 LiptonReduction]: Checked pairs total: 344 [2021-06-11 16:26:48,017 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:48,017 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 100 [2021-06-11 16:26:48,017 INFO L480 AbstractCegarLoop]: Abstraction has has 94 places, 121 transitions, 1748 flow [2021-06-11 16:26:48,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:48,018 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:48,018 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:48,018 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 16:26:48,018 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 16:26:48,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:48,019 INFO L82 PathProgramCache]: Analyzing trace with hash -415488554, now seen corresponding path program 5 times [2021-06-11 16:26:48,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:48,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759183756] [2021-06-11 16:26:48,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:48,114 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-06-11 16:26:48,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:48,124 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-06-11 16:26:48,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:48,125 INFO L142 QuantifierPusher]: treesize reduction 30, result has 34.8 percent of original size [2021-06-11 16:26:48,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:26:48,141 INFO L142 QuantifierPusher]: treesize reduction 37, result has 46.4 percent of original size [2021-06-11 16:26:48,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 16:26:48,150 INFO L142 QuantifierPusher]: treesize reduction 58, result has 65.5 percent of original size [2021-06-11 16:26:48,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 110 [2021-06-11 16:26:48,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:48,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 16:26:48,251 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 16:26:48,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759183756] [2021-06-11 16:26:48,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:48,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:26:48,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87436750] [2021-06-11 16:26:48,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:26:48,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:48,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:26:48,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:26:48,253 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 182 [2021-06-11 16:26:48,254 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 121 transitions, 1748 flow. Second operand has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:48,254 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:48,254 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 182 [2021-06-11 16:26:48,254 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:48,611 INFO L129 PetriNetUnfolder]: 238/539 cut-off events. [2021-06-11 16:26:48,611 INFO L130 PetriNetUnfolder]: For 6350/6494 co-relation queries the response was YES. [2021-06-11 16:26:48,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3478 conditions, 539 events. 238/539 cut-off events. For 6350/6494 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3372 event pairs, 10 based on Foata normal form. 92/616 useless extension candidates. Maximal degree in co-relation 3435. Up to 279 conditions per place. [2021-06-11 16:26:48,619 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 45 selfloop transitions, 59 changer transitions 10/128 dead transitions. [2021-06-11 16:26:48,619 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 128 transitions, 2060 flow [2021-06-11 16:26:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 16:26:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 16:26:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1008 transitions. [2021-06-11 16:26:48,623 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2021-06-11 16:26:48,623 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1008 transitions. [2021-06-11 16:26:48,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1008 transitions. [2021-06-11 16:26:48,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:48,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1008 transitions. [2021-06-11 16:26:48,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:48,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:48,628 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:48,628 INFO L185 Difference]: Start difference. First operand has 94 places, 121 transitions, 1748 flow. Second operand 8 states and 1008 transitions. [2021-06-11 16:26:48,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 128 transitions, 2060 flow [2021-06-11 16:26:48,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 128 transitions, 1949 flow, removed 20 selfloop flow, removed 5 redundant places. [2021-06-11 16:26:48,653 INFO L241 Difference]: Finished difference. Result has 97 places, 113 transitions, 1679 flow [2021-06-11 16:26:48,654 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1679, PETRI_PLACES=97, PETRI_TRANSITIONS=113} [2021-06-11 16:26:48,654 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 62 predicate places. [2021-06-11 16:26:48,654 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:48,654 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 113 transitions, 1679 flow [2021-06-11 16:26:48,654 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 113 transitions, 1679 flow [2021-06-11 16:26:48,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 97 places, 113 transitions, 1679 flow [2021-06-11 16:26:48,726 INFO L129 PetriNetUnfolder]: 154/424 cut-off events. [2021-06-11 16:26:48,727 INFO L130 PetriNetUnfolder]: For 4880/4966 co-relation queries the response was YES. [2021-06-11 16:26:48,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2692 conditions, 424 events. 154/424 cut-off events. For 4880/4966 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2739 event pairs, 1 based on Foata normal form. 56/467 useless extension candidates. Maximal degree in co-relation 2651. Up to 131 conditions per place. [2021-06-11 16:26:48,737 INFO L151 LiptonReduction]: Number of co-enabled transitions 940 [2021-06-11 16:26:48,751 INFO L163 LiptonReduction]: Checked pairs total: 316 [2021-06-11 16:26:48,751 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:48,751 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 97 [2021-06-11 16:26:48,752 INFO L480 AbstractCegarLoop]: Abstraction has has 97 places, 113 transitions, 1679 flow [2021-06-11 16:26:48,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:48,752 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:48,752 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:48,753 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 16:26:48,753 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:26:48,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:48,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1773058100, now seen corresponding path program 1 times [2021-06-11 16:26:48,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:48,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373968349] [2021-06-11 16:26:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:48,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:48,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:48,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:48,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:26:48,800 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 16:26:48,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373968349] [2021-06-11 16:26:48,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:48,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:26:48,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375929571] [2021-06-11 16:26:48,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:26:48,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:48,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:26:48,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:26:48,803 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 182 [2021-06-11 16:26:48,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 113 transitions, 1679 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:48,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:48,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 182 [2021-06-11 16:26:48,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:48,899 INFO L129 PetriNetUnfolder]: 149/468 cut-off events. [2021-06-11 16:26:48,899 INFO L130 PetriNetUnfolder]: For 5519/5586 co-relation queries the response was YES. [2021-06-11 16:26:48,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2945 conditions, 468 events. 149/468 cut-off events. For 5519/5586 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3224 event pairs, 6 based on Foata normal form. 32/488 useless extension candidates. Maximal degree in co-relation 2902. Up to 149 conditions per place. [2021-06-11 16:26:48,905 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 3 selfloop transitions, 3 changer transitions 16/113 dead transitions. [2021-06-11 16:26:48,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 113 transitions, 1691 flow [2021-06-11 16:26:48,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:26:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:26:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2021-06-11 16:26:48,907 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8406593406593407 [2021-06-11 16:26:48,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2021-06-11 16:26:48,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2021-06-11 16:26:48,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:48,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2021-06-11 16:26:48,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:48,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:48,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:48,910 INFO L185 Difference]: Start difference. First operand has 97 places, 113 transitions, 1679 flow. Second operand 3 states and 459 transitions. [2021-06-11 16:26:48,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 113 transitions, 1691 flow [2021-06-11 16:26:48,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 113 transitions, 1610 flow, removed 12 selfloop flow, removed 5 redundant places. [2021-06-11 16:26:48,935 INFO L241 Difference]: Finished difference. Result has 95 places, 97 transitions, 1360 flow [2021-06-11 16:26:48,935 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1598, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1360, PETRI_PLACES=95, PETRI_TRANSITIONS=97} [2021-06-11 16:26:48,935 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 60 predicate places. [2021-06-11 16:26:48,935 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:48,936 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 97 transitions, 1360 flow [2021-06-11 16:26:48,936 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 97 transitions, 1360 flow [2021-06-11 16:26:48,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 94 places, 97 transitions, 1360 flow [2021-06-11 16:26:49,046 INFO L129 PetriNetUnfolder]: 175/506 cut-off events. [2021-06-11 16:26:49,047 INFO L130 PetriNetUnfolder]: For 5482/5596 co-relation queries the response was YES. [2021-06-11 16:26:49,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 506 events. 175/506 cut-off events. For 5482/5596 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3557 event pairs, 0 based on Foata normal form. 71/566 useless extension candidates. Maximal degree in co-relation 3040. Up to 159 conditions per place. [2021-06-11 16:26:49,057 INFO L151 LiptonReduction]: Number of co-enabled transitions 802 [2021-06-11 16:26:49,067 INFO L163 LiptonReduction]: Checked pairs total: 268 [2021-06-11 16:26:49,067 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:49,067 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 132 [2021-06-11 16:26:49,070 INFO L480 AbstractCegarLoop]: Abstraction has has 94 places, 97 transitions, 1360 flow [2021-06-11 16:26:49,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:49,071 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:49,071 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:49,071 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-11 16:26:49,071 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:26:49,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:49,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1746820142, now seen corresponding path program 1 times [2021-06-11 16:26:49,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:49,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268926877] [2021-06-11 16:26:49,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:49,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:49,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:26:49,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:49,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:26:49,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:49,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 16:26:49,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:49,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 16:26:49,200 INFO L142 QuantifierPusher]: treesize reduction 4, result has 84.0 percent of original size [2021-06-11 16:26:49,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 16:26:49,222 INFO L142 QuantifierPusher]: treesize reduction 20, result has 55.6 percent of original size [2021-06-11 16:26:49,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 16:26:49,257 INFO L142 QuantifierPusher]: treesize reduction 20, result has 79.4 percent of original size [2021-06-11 16:26:49,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 77 [2021-06-11 16:26:49,322 INFO L142 QuantifierPusher]: treesize reduction 3, result has 86.4 percent of original size [2021-06-11 16:26:49,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 16:26:49,343 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 16:26:49,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268926877] [2021-06-11 16:26:49,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:49,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 16:26:49,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225504369] [2021-06-11 16:26:49,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 16:26:49,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:49,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 16:26:49,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-11 16:26:49,345 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 182 [2021-06-11 16:26:49,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 97 transitions, 1360 flow. Second operand has 10 states, 10 states have (on average 117.9) internal successors, (1179), 10 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:49,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:49,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 182 [2021-06-11 16:26:49,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:49,998 INFO L129 PetriNetUnfolder]: 264/689 cut-off events. [2021-06-11 16:26:50,001 INFO L130 PetriNetUnfolder]: For 7555/7691 co-relation queries the response was YES. [2021-06-11 16:26:50,005 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4407 conditions, 689 events. 264/689 cut-off events. For 7555/7691 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5007 event pairs, 3 based on Foata normal form. 107/777 useless extension candidates. Maximal degree in co-relation 4365. Up to 191 conditions per place. [2021-06-11 16:26:50,009 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 36 selfloop transitions, 61 changer transitions 8/119 dead transitions. [2021-06-11 16:26:50,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 119 transitions, 1859 flow [2021-06-11 16:26:50,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 16:26:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 16:26:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1336 transitions. [2021-06-11 16:26:50,014 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6673326673326674 [2021-06-11 16:26:50,014 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1336 transitions. [2021-06-11 16:26:50,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1336 transitions. [2021-06-11 16:26:50,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:50,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1336 transitions. [2021-06-11 16:26:50,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.45454545454545) internal successors, (1336), 11 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:50,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 182.0) internal successors, (2184), 12 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:50,033 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 182.0) internal successors, (2184), 12 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:50,033 INFO L185 Difference]: Start difference. First operand has 94 places, 97 transitions, 1360 flow. Second operand 11 states and 1336 transitions. [2021-06-11 16:26:50,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 119 transitions, 1859 flow [2021-06-11 16:26:50,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 119 transitions, 1761 flow, removed 11 selfloop flow, removed 9 redundant places. [2021-06-11 16:26:50,058 INFO L241 Difference]: Finished difference. Result has 98 places, 101 transitions, 1535 flow [2021-06-11 16:26:50,059 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1269, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1535, PETRI_PLACES=98, PETRI_TRANSITIONS=101} [2021-06-11 16:26:50,059 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 63 predicate places. [2021-06-11 16:26:50,059 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:50,059 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 101 transitions, 1535 flow [2021-06-11 16:26:50,059 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 101 transitions, 1535 flow [2021-06-11 16:26:50,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 101 transitions, 1535 flow [2021-06-11 16:26:50,152 INFO L129 PetriNetUnfolder]: 153/524 cut-off events. [2021-06-11 16:26:50,152 INFO L130 PetriNetUnfolder]: For 6688/6753 co-relation queries the response was YES. [2021-06-11 16:26:50,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3352 conditions, 524 events. 153/524 cut-off events. For 6688/6753 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3947 event pairs, 1 based on Foata normal form. 34/541 useless extension candidates. Maximal degree in co-relation 3312. Up to 167 conditions per place. [2021-06-11 16:26:50,161 INFO L151 LiptonReduction]: Number of co-enabled transitions 780 [2021-06-11 16:26:50,177 INFO L163 LiptonReduction]: Checked pairs total: 284 [2021-06-11 16:26:50,177 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:50,177 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 118 [2021-06-11 16:26:50,178 INFO L480 AbstractCegarLoop]: Abstraction has has 98 places, 101 transitions, 1535 flow [2021-06-11 16:26:50,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 117.9) internal successors, (1179), 10 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:50,178 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:50,178 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:50,178 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-11 16:26:50,179 INFO L428 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:26:50,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:50,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1747418132, now seen corresponding path program 2 times [2021-06-11 16:26:50,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:50,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436512660] [2021-06-11 16:26:50,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:50,288 INFO L142 QuantifierPusher]: treesize reduction 30, result has 38.8 percent of original size [2021-06-11 16:26:50,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 16:26:50,306 INFO L142 QuantifierPusher]: treesize reduction 30, result has 42.3 percent of original size [2021-06-11 16:26:50,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 16:26:50,324 INFO L142 QuantifierPusher]: treesize reduction 37, result has 48.6 percent of original size [2021-06-11 16:26:50,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-11 16:26:50,353 INFO L142 QuantifierPusher]: treesize reduction 40, result has 67.2 percent of original size [2021-06-11 16:26:50,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 82 [2021-06-11 16:26:50,399 INFO L142 QuantifierPusher]: treesize reduction 40, result has 68.0 percent of original size [2021-06-11 16:26:50,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 85 [2021-06-11 16:26:50,440 INFO L142 QuantifierPusher]: treesize reduction 40, result has 69.0 percent of original size [2021-06-11 16:26:50,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2021-06-11 16:26:50,506 INFO L142 QuantifierPusher]: treesize reduction 44, result has 67.6 percent of original size [2021-06-11 16:26:50,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 92 [2021-06-11 16:26:50,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:50,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 16:26:50,589 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 16:26:50,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436512660] [2021-06-11 16:26:50,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:50,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 16:26:50,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612702181] [2021-06-11 16:26:50,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 16:26:50,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:50,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 16:26:50,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-11 16:26:50,592 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 182 [2021-06-11 16:26:50,592 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 101 transitions, 1535 flow. Second operand has 10 states, 10 states have (on average 115.9) internal successors, (1159), 10 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:50,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:50,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 182 [2021-06-11 16:26:50,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:51,012 INFO L129 PetriNetUnfolder]: 243/618 cut-off events. [2021-06-11 16:26:51,012 INFO L130 PetriNetUnfolder]: For 7884/7999 co-relation queries the response was YES. [2021-06-11 16:26:51,016 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4141 conditions, 618 events. 243/618 cut-off events. For 7884/7999 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4319 event pairs, 3 based on Foata normal form. 95/695 useless extension candidates. Maximal degree in co-relation 4099. Up to 250 conditions per place. [2021-06-11 16:26:51,019 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 39 selfloop transitions, 61 changer transitions 2/116 dead transitions. [2021-06-11 16:26:51,019 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 116 transitions, 1917 flow [2021-06-11 16:26:51,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 16:26:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 16:26:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2021-06-11 16:26:51,024 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6593406593406593 [2021-06-11 16:26:51,024 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2021-06-11 16:26:51,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2021-06-11 16:26:51,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:51,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2021-06-11 16:26:51,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.0) internal successors, (840), 7 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 16:26:51,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:51,030 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:51,030 INFO L185 Difference]: Start difference. First operand has 98 places, 101 transitions, 1535 flow. Second operand 7 states and 840 transitions. [2021-06-11 16:26:51,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 116 transitions, 1917 flow [2021-06-11 16:26:51,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 116 transitions, 1805 flow, removed 19 selfloop flow, removed 6 redundant places. [2021-06-11 16:26:51,056 INFO L241 Difference]: Finished difference. Result has 100 places, 105 transitions, 1665 flow [2021-06-11 16:26:51,056 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1665, PETRI_PLACES=100, PETRI_TRANSITIONS=105} [2021-06-11 16:26:51,057 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 65 predicate places. [2021-06-11 16:26:51,057 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:51,057 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 105 transitions, 1665 flow [2021-06-11 16:26:51,058 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 105 transitions, 1665 flow [2021-06-11 16:26:51,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 105 transitions, 1665 flow [2021-06-11 16:26:51,173 INFO L129 PetriNetUnfolder]: 159/532 cut-off events. [2021-06-11 16:26:51,174 INFO L130 PetriNetUnfolder]: For 7388/7478 co-relation queries the response was YES. [2021-06-11 16:26:51,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3557 conditions, 532 events. 159/532 cut-off events. For 7388/7478 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3969 event pairs, 2 based on Foata normal form. 41/556 useless extension candidates. Maximal degree in co-relation 3516. Up to 156 conditions per place. [2021-06-11 16:26:51,185 INFO L151 LiptonReduction]: Number of co-enabled transitions 812 [2021-06-11 16:26:51,204 INFO L163 LiptonReduction]: Checked pairs total: 300 [2021-06-11 16:26:51,204 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:51,204 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 147 [2021-06-11 16:26:51,205 INFO L480 AbstractCegarLoop]: Abstraction has has 100 places, 105 transitions, 1665 flow [2021-06-11 16:26:51,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 115.9) internal successors, (1159), 10 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:51,205 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:51,205 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:51,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 16:26:51,205 INFO L428 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:26:51,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:51,206 INFO L82 PathProgramCache]: Analyzing trace with hash 85371953, now seen corresponding path program 1 times [2021-06-11 16:26:51,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:51,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953744097] [2021-06-11 16:26:51,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:51,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:51,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:26:51,281 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 16:26:51,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:51,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:51,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:51,291 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 16:26:51,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953744097] [2021-06-11 16:26:51,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:51,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:26:51,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215565703] [2021-06-11 16:26:51,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:26:51,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:51,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:26:51,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:26:51,293 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2021-06-11 16:26:51,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 105 transitions, 1665 flow. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:51,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:51,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2021-06-11 16:26:51,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:51,499 INFO L129 PetriNetUnfolder]: 595/1317 cut-off events. [2021-06-11 16:26:51,499 INFO L130 PetriNetUnfolder]: For 7154/7368 co-relation queries the response was YES. [2021-06-11 16:26:51,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4424 conditions, 1317 events. 595/1317 cut-off events. For 7154/7368 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 10384 event pairs, 145 based on Foata normal form. 159/1201 useless extension candidates. Maximal degree in co-relation 4381. Up to 639 conditions per place. [2021-06-11 16:26:51,513 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 8 selfloop transitions, 10 changer transitions 0/96 dead transitions. [2021-06-11 16:26:51,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 96 transitions, 1355 flow [2021-06-11 16:26:51,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:26:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:26:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 735 transitions. [2021-06-11 16:26:51,516 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8076923076923077 [2021-06-11 16:26:51,516 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 735 transitions. [2021-06-11 16:26:51,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 735 transitions. [2021-06-11 16:26:51,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:51,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 735 transitions. [2021-06-11 16:26:51,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.0) internal successors, (735), 5 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:51,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:51,519 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:51,519 INFO L185 Difference]: Start difference. First operand has 100 places, 105 transitions, 1665 flow. Second operand 5 states and 735 transitions. [2021-06-11 16:26:51,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 96 transitions, 1355 flow [2021-06-11 16:26:51,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 96 transitions, 1228 flow, removed 10 selfloop flow, removed 12 redundant places. [2021-06-11 16:26:51,538 INFO L241 Difference]: Finished difference. Result has 95 places, 93 transitions, 1239 flow [2021-06-11 16:26:51,538 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1239, PETRI_PLACES=95, PETRI_TRANSITIONS=93} [2021-06-11 16:26:51,538 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 60 predicate places. [2021-06-11 16:26:51,538 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:51,539 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 93 transitions, 1239 flow [2021-06-11 16:26:51,539 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 93 transitions, 1239 flow [2021-06-11 16:26:51,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 93 transitions, 1239 flow [2021-06-11 16:26:51,661 INFO L129 PetriNetUnfolder]: 481/1139 cut-off events. [2021-06-11 16:26:51,661 INFO L130 PetriNetUnfolder]: For 7554/8081 co-relation queries the response was YES. [2021-06-11 16:26:51,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4655 conditions, 1139 events. 481/1139 cut-off events. For 7554/8081 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 9496 event pairs, 137 based on Foata normal form. 67/1059 useless extension candidates. Maximal degree in co-relation 4615. Up to 693 conditions per place. [2021-06-11 16:26:51,681 INFO L151 LiptonReduction]: Number of co-enabled transitions 1026 [2021-06-11 16:26:51,688 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:26:51,689 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:51,689 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 151 [2021-06-11 16:26:51,690 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 93 transitions, 1239 flow [2021-06-11 16:26:51,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:51,690 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:51,690 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 16:26:51,690 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-11 16:26:51,691 INFO L428 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:26:51,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:51,691 INFO L82 PathProgramCache]: Analyzing trace with hash -256935765, now seen corresponding path program 1 times [2021-06-11 16:26:51,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:51,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571640167] [2021-06-11 16:26:51,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:51,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:51,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:26:51,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:51,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:26:51,771 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 16:26:51,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:51,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:51,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:51,782 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 16:26:51,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571640167] [2021-06-11 16:26:51,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:51,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:26:51,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965278590] [2021-06-11 16:26:51,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:26:51,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:51,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:26:51,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:26:51,786 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2021-06-11 16:26:51,786 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 93 transitions, 1239 flow. Second operand has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:51,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:51,787 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2021-06-11 16:26:51,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:52,002 INFO L129 PetriNetUnfolder]: 470/1168 cut-off events. [2021-06-11 16:26:52,003 INFO L130 PetriNetUnfolder]: For 6613/8893 co-relation queries the response was YES. [2021-06-11 16:26:52,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5396 conditions, 1168 events. 470/1168 cut-off events. For 6613/8893 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 9530 event pairs, 16 based on Foata normal form. 540/1563 useless extension candidates. Maximal degree in co-relation 5354. Up to 680 conditions per place. [2021-06-11 16:26:52,015 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 5 selfloop transitions, 18 changer transitions 3/104 dead transitions. [2021-06-11 16:26:52,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 104 transitions, 1354 flow [2021-06-11 16:26:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 16:26:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 16:26:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1029 transitions. [2021-06-11 16:26:52,018 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8076923076923077 [2021-06-11 16:26:52,018 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1029 transitions. [2021-06-11 16:26:52,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1029 transitions. [2021-06-11 16:26:52,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:52,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1029 transitions. [2021-06-11 16:26:52,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 147.0) internal successors, (1029), 7 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:52,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:52,021 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:52,021 INFO L185 Difference]: Start difference. First operand has 95 places, 93 transitions, 1239 flow. Second operand 7 states and 1029 transitions. [2021-06-11 16:26:52,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 104 transitions, 1354 flow [2021-06-11 16:26:52,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 104 transitions, 1354 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 16:26:52,047 INFO L241 Difference]: Finished difference. Result has 104 places, 101 transitions, 1352 flow [2021-06-11 16:26:52,048 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1352, PETRI_PLACES=104, PETRI_TRANSITIONS=101} [2021-06-11 16:26:52,048 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2021-06-11 16:26:52,048 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:52,048 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 101 transitions, 1352 flow [2021-06-11 16:26:52,050 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 101 transitions, 1352 flow [2021-06-11 16:26:52,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 101 transitions, 1352 flow [2021-06-11 16:26:52,169 INFO L129 PetriNetUnfolder]: 414/1096 cut-off events. [2021-06-11 16:26:52,170 INFO L130 PetriNetUnfolder]: For 8170/8835 co-relation queries the response was YES. [2021-06-11 16:26:52,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5643 conditions, 1096 events. 414/1096 cut-off events. For 8170/8835 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 9250 event pairs, 16 based on Foata normal form. 30/1009 useless extension candidates. Maximal degree in co-relation 5598. Up to 608 conditions per place. [2021-06-11 16:26:52,219 INFO L151 LiptonReduction]: Number of co-enabled transitions 1086 [2021-06-11 16:26:52,226 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:26:52,226 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:52,226 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 178 [2021-06-11 16:26:52,227 INFO L480 AbstractCegarLoop]: Abstraction has has 104 places, 101 transitions, 1352 flow [2021-06-11 16:26:52,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:52,228 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:52,228 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:52,228 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-11 16:26:52,228 INFO L428 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:26:52,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:52,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1668156901, now seen corresponding path program 1 times [2021-06-11 16:26:52,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:52,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483767033] [2021-06-11 16:26:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:52,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:52,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:26:52,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:52,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:26:52,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:52,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:26:52,308 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 16:26:52,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:26:52,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:52,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:26:52,319 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 16:26:52,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483767033] [2021-06-11 16:26:52,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:52,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 16:26:52,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72222578] [2021-06-11 16:26:52,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:26:52,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:52,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:26:52,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:26:52,320 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2021-06-11 16:26:52,321 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 101 transitions, 1352 flow. Second operand has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:52,321 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:52,321 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2021-06-11 16:26:52,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:52,537 INFO L129 PetriNetUnfolder]: 379/1013 cut-off events. [2021-06-11 16:26:52,537 INFO L130 PetriNetUnfolder]: For 7711/10778 co-relation queries the response was YES. [2021-06-11 16:26:52,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5839 conditions, 1013 events. 379/1013 cut-off events. For 7711/10778 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 8407 event pairs, 0 based on Foata normal form. 545/1413 useless extension candidates. Maximal degree in co-relation 5792. Up to 583 conditions per place. [2021-06-11 16:26:52,554 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 2 selfloop transitions, 22 changer transitions 5/106 dead transitions. [2021-06-11 16:26:52,554 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 106 transitions, 1446 flow [2021-06-11 16:26:52,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 16:26:52,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 16:26:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1317 transitions. [2021-06-11 16:26:52,557 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8040293040293041 [2021-06-11 16:26:52,557 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1317 transitions. [2021-06-11 16:26:52,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1317 transitions. [2021-06-11 16:26:52,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:52,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1317 transitions. [2021-06-11 16:26:52,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 146.33333333333334) internal successors, (1317), 9 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:52,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:52,562 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:52,562 INFO L185 Difference]: Start difference. First operand has 104 places, 101 transitions, 1352 flow. Second operand 9 states and 1317 transitions. [2021-06-11 16:26:52,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 106 transitions, 1446 flow [2021-06-11 16:26:52,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 106 transitions, 1343 flow, removed 28 selfloop flow, removed 5 redundant places. [2021-06-11 16:26:52,615 INFO L241 Difference]: Finished difference. Result has 110 places, 101 transitions, 1302 flow [2021-06-11 16:26:52,615 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1302, PETRI_PLACES=110, PETRI_TRANSITIONS=101} [2021-06-11 16:26:52,616 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 75 predicate places. [2021-06-11 16:26:52,616 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:52,616 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 101 transitions, 1302 flow [2021-06-11 16:26:52,616 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 101 transitions, 1302 flow [2021-06-11 16:26:52,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 1302 flow [2021-06-11 16:26:52,709 INFO L129 PetriNetUnfolder]: 361/979 cut-off events. [2021-06-11 16:26:52,710 INFO L130 PetriNetUnfolder]: For 5376/5781 co-relation queries the response was YES. [2021-06-11 16:26:52,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4883 conditions, 979 events. 361/979 cut-off events. For 5376/5781 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 8304 event pairs, 0 based on Foata normal form. 38/894 useless extension candidates. Maximal degree in co-relation 4837. Up to 352 conditions per place. [2021-06-11 16:26:52,723 INFO L151 LiptonReduction]: Number of co-enabled transitions 1036 [2021-06-11 16:26:52,729 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:26:52,729 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:52,730 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 114 [2021-06-11 16:26:52,730 INFO L480 AbstractCegarLoop]: Abstraction has has 109 places, 101 transitions, 1302 flow [2021-06-11 16:26:52,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:52,730 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:52,731 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:52,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-11 16:26:52,731 INFO L428 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:26:52,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:52,731 INFO L82 PathProgramCache]: Analyzing trace with hash 454886412, now seen corresponding path program 1 times [2021-06-11 16:26:52,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:52,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884126202] [2021-06-11 16:26:52,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:52,820 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-06-11 16:26:52,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-06-11 16:26:52,858 INFO L142 QuantifierPusher]: treesize reduction 26, result has 80.9 percent of original size [2021-06-11 16:26:52,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 110 [2021-06-11 16:26:52,868 INFO L142 QuantifierPusher]: treesize reduction 96, result has 54.7 percent of original size [2021-06-11 16:26:52,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 116 [2021-06-11 16:26:52,932 INFO L142 QuantifierPusher]: treesize reduction 5, result has 89.8 percent of original size [2021-06-11 16:26:52,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-11 16:26:52,974 INFO L142 QuantifierPusher]: treesize reduction 22, result has 77.1 percent of original size [2021-06-11 16:26:52,975 INFO L147 QuantifierPusher]: treesize reduction 9, result has 87.8 percent of original size 65 [2021-06-11 16:26:53,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:53,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 16:26:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:26:53,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884126202] [2021-06-11 16:26:53,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:53,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 16:26:53,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23760827] [2021-06-11 16:26:53,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 16:26:53,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 16:26:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-11 16:26:53,042 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 182 [2021-06-11 16:26:53,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 101 transitions, 1302 flow. Second operand has 7 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:53,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:53,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 182 [2021-06-11 16:26:53,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:53,486 INFO L129 PetriNetUnfolder]: 397/1071 cut-off events. [2021-06-11 16:26:53,486 INFO L130 PetriNetUnfolder]: For 8481/9282 co-relation queries the response was YES. [2021-06-11 16:26:53,493 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5472 conditions, 1071 events. 397/1071 cut-off events. For 8481/9282 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 9083 event pairs, 0 based on Foata normal form. 110/1024 useless extension candidates. Maximal degree in co-relation 5424. Up to 400 conditions per place. [2021-06-11 16:26:53,499 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 42 selfloop transitions, 23 changer transitions 9/105 dead transitions. [2021-06-11 16:26:53,499 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 105 transitions, 1515 flow [2021-06-11 16:26:53,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 16:26:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 16:26:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 842 transitions. [2021-06-11 16:26:53,504 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6609105180533752 [2021-06-11 16:26:53,504 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 842 transitions. [2021-06-11 16:26:53,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 842 transitions. [2021-06-11 16:26:53,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:53,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 842 transitions. [2021-06-11 16:26:53,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:53,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:53,512 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:53,512 INFO L185 Difference]: Start difference. First operand has 109 places, 101 transitions, 1302 flow. Second operand 7 states and 842 transitions. [2021-06-11 16:26:53,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 105 transitions, 1515 flow [2021-06-11 16:26:53,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 1443 flow, removed 16 selfloop flow, removed 8 redundant places. [2021-06-11 16:26:53,592 INFO L241 Difference]: Finished difference. Result has 108 places, 95 transitions, 1207 flow [2021-06-11 16:26:53,592 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1207, PETRI_PLACES=108, PETRI_TRANSITIONS=95} [2021-06-11 16:26:53,592 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 73 predicate places. [2021-06-11 16:26:53,592 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:53,592 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 95 transitions, 1207 flow [2021-06-11 16:26:53,592 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 95 transitions, 1207 flow [2021-06-11 16:26:53,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 95 transitions, 1207 flow [2021-06-11 16:26:53,657 INFO L129 PetriNetUnfolder]: 324/875 cut-off events. [2021-06-11 16:26:53,657 INFO L130 PetriNetUnfolder]: For 3224/3292 co-relation queries the response was YES. [2021-06-11 16:26:53,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3868 conditions, 875 events. 324/875 cut-off events. For 3224/3292 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 7282 event pairs, 0 based on Foata normal form. 20/794 useless extension candidates. Maximal degree in co-relation 3824. Up to 320 conditions per place. [2021-06-11 16:26:53,671 INFO L151 LiptonReduction]: Number of co-enabled transitions 960 [2021-06-11 16:26:53,676 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:26:53,676 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:53,676 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 84 [2021-06-11 16:26:53,677 INFO L480 AbstractCegarLoop]: Abstraction has has 107 places, 95 transitions, 1207 flow [2021-06-11 16:26:53,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:53,677 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:53,677 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:53,677 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-11 16:26:53,677 INFO L428 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:26:53,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:53,678 INFO L82 PathProgramCache]: Analyzing trace with hash 953408164, now seen corresponding path program 2 times [2021-06-11 16:26:53,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:53,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328216098] [2021-06-11 16:26:53,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:53,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:53,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:26:53,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:53,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:26:53,788 INFO L142 QuantifierPusher]: treesize reduction 24, result has 70.4 percent of original size [2021-06-11 16:26:53,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-06-11 16:26:53,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:53,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 16:26:53,830 INFO L142 QuantifierPusher]: treesize reduction 33, result has 56.0 percent of original size [2021-06-11 16:26:53,831 INFO L147 QuantifierPusher]: treesize reduction 8, result has 81.0 percent of original size 34 [2021-06-11 16:26:53,864 INFO L142 QuantifierPusher]: treesize reduction 28, result has 64.6 percent of original size [2021-06-11 16:26:53,865 INFO L147 QuantifierPusher]: treesize reduction 9, result has 82.4 percent of original size 42 [2021-06-11 16:26:53,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:53,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 16:26:53,917 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 16:26:53,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328216098] [2021-06-11 16:26:53,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:53,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 16:26:53,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944834842] [2021-06-11 16:26:53,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 16:26:53,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 16:26:53,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-11 16:26:53,919 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 182 [2021-06-11 16:26:53,920 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 95 transitions, 1207 flow. Second operand has 9 states, 9 states have (on average 125.11111111111111) internal successors, (1126), 9 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:53,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:53,920 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 182 [2021-06-11 16:26:53,920 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:54,347 INFO L129 PetriNetUnfolder]: 362/976 cut-off events. [2021-06-11 16:26:54,347 INFO L130 PetriNetUnfolder]: For 4278/4607 co-relation queries the response was YES. [2021-06-11 16:26:54,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4401 conditions, 976 events. 362/976 cut-off events. For 4278/4607 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 8143 event pairs, 0 based on Foata normal form. 103/936 useless extension candidates. Maximal degree in co-relation 4355. Up to 368 conditions per place. [2021-06-11 16:26:54,355 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 17 selfloop transitions, 15 changer transitions 34/97 dead transitions. [2021-06-11 16:26:54,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 97 transitions, 1369 flow [2021-06-11 16:26:54,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 16:26:54,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 16:26:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1144 transitions. [2021-06-11 16:26:54,358 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2021-06-11 16:26:54,358 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1144 transitions. [2021-06-11 16:26:54,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1144 transitions. [2021-06-11 16:26:54,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:54,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1144 transitions. [2021-06-11 16:26:54,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.11111111111111) internal successors, (1144), 9 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:54,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:54,362 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:54,362 INFO L185 Difference]: Start difference. First operand has 107 places, 95 transitions, 1207 flow. Second operand 9 states and 1144 transitions. [2021-06-11 16:26:54,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 97 transitions, 1369 flow [2021-06-11 16:26:54,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 97 transitions, 1337 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-06-11 16:26:54,408 INFO L241 Difference]: Finished difference. Result has 112 places, 63 transitions, 714 flow [2021-06-11 16:26:54,408 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=714, PETRI_PLACES=112, PETRI_TRANSITIONS=63} [2021-06-11 16:26:54,409 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 77 predicate places. [2021-06-11 16:26:54,409 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:54,409 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 63 transitions, 714 flow [2021-06-11 16:26:54,409 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 63 transitions, 714 flow [2021-06-11 16:26:54,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 63 transitions, 714 flow [2021-06-11 16:26:54,449 INFO L129 PetriNetUnfolder]: 137/387 cut-off events. [2021-06-11 16:26:54,449 INFO L130 PetriNetUnfolder]: For 1405/1421 co-relation queries the response was YES. [2021-06-11 16:26:54,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 387 events. 137/387 cut-off events. For 1405/1421 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 2615 event pairs, 0 based on Foata normal form. 6/350 useless extension candidates. Maximal degree in co-relation 1687. Up to 144 conditions per place. [2021-06-11 16:26:54,455 INFO L151 LiptonReduction]: Number of co-enabled transitions 454 [2021-06-11 16:26:54,458 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:26:54,458 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:54,458 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-06-11 16:26:54,459 INFO L480 AbstractCegarLoop]: Abstraction has has 107 places, 63 transitions, 714 flow [2021-06-11 16:26:54,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 125.11111111111111) internal successors, (1126), 9 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:54,459 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:54,459 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:54,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-11 16:26:54,459 INFO L428 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:26:54,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:54,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1654963446, now seen corresponding path program 3 times [2021-06-11 16:26:54,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:54,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509690182] [2021-06-11 16:26:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:54,584 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-06-11 16:26:54,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 16:26:54,610 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-06-11 16:26:54,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 16:26:54,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:54,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:26:54,657 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-06-11 16:26:54,658 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-06-11 16:26:54,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:54,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:26:54,698 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 16:26:54,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509690182] [2021-06-11 16:26:54,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:54,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 16:26:54,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472627788] [2021-06-11 16:26:54,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 16:26:54,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:54,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 16:26:54,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-11 16:26:54,700 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 182 [2021-06-11 16:26:54,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 63 transitions, 714 flow. Second operand has 7 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:54,701 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:54,701 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 182 [2021-06-11 16:26:54,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:54,862 INFO L129 PetriNetUnfolder]: 227/625 cut-off events. [2021-06-11 16:26:54,863 INFO L130 PetriNetUnfolder]: For 2740/3012 co-relation queries the response was YES. [2021-06-11 16:26:54,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2764 conditions, 625 events. 227/625 cut-off events. For 2740/3012 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 4600 event pairs, 0 based on Foata normal form. 61/589 useless extension candidates. Maximal degree in co-relation 2718. Up to 256 conditions per place. [2021-06-11 16:26:54,868 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 21 selfloop transitions, 5 changer transitions 14/71 dead transitions. [2021-06-11 16:26:54,868 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 71 transitions, 907 flow [2021-06-11 16:26:54,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 16:26:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 16:26:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 753 transitions. [2021-06-11 16:26:54,870 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6895604395604396 [2021-06-11 16:26:54,870 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 753 transitions. [2021-06-11 16:26:54,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 753 transitions. [2021-06-11 16:26:54,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:54,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 753 transitions. [2021-06-11 16:26:54,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:54,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:54,873 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:54,873 INFO L185 Difference]: Start difference. First operand has 107 places, 63 transitions, 714 flow. Second operand 6 states and 753 transitions. [2021-06-11 16:26:54,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 71 transitions, 907 flow [2021-06-11 16:26:54,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 71 transitions, 662 flow, removed 30 selfloop flow, removed 25 redundant places. [2021-06-11 16:26:54,897 INFO L241 Difference]: Finished difference. Result has 88 places, 57 transitions, 456 flow [2021-06-11 16:26:54,897 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=456, PETRI_PLACES=88, PETRI_TRANSITIONS=57} [2021-06-11 16:26:54,897 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 53 predicate places. [2021-06-11 16:26:54,897 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:54,897 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 57 transitions, 456 flow [2021-06-11 16:26:54,897 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 57 transitions, 456 flow [2021-06-11 16:26:54,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 57 transitions, 456 flow [2021-06-11 16:26:54,929 INFO L129 PetriNetUnfolder]: 129/364 cut-off events. [2021-06-11 16:26:54,929 INFO L130 PetriNetUnfolder]: For 716/727 co-relation queries the response was YES. [2021-06-11 16:26:54,930 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 364 events. 129/364 cut-off events. For 716/727 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 2482 event pairs, 0 based on Foata normal form. 3/325 useless extension candidates. Maximal degree in co-relation 1414. Up to 144 conditions per place. [2021-06-11 16:26:54,933 INFO L151 LiptonReduction]: Number of co-enabled transitions 400 [2021-06-11 16:26:54,936 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:26:54,936 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:54,936 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-06-11 16:26:54,937 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 57 transitions, 456 flow [2021-06-11 16:26:54,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:54,937 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:54,937 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:54,937 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-11 16:26:54,937 INFO L428 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:26:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:54,938 INFO L82 PathProgramCache]: Analyzing trace with hash -400222730, now seen corresponding path program 4 times [2021-06-11 16:26:54,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:54,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103760800] [2021-06-11 16:26:54,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:26:55,032 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-06-11 16:26:55,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 16:26:55,062 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-06-11 16:26:55,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 16:26:55,101 INFO L142 QuantifierPusher]: treesize reduction 12, result has 89.5 percent of original size [2021-06-11 16:26:55,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 102 [2021-06-11 16:26:55,160 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-06-11 16:26:55,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 16:26:55,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:26:55,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:26:55,194 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 16:26:55,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103760800] [2021-06-11 16:26:55,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:26:55,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 16:26:55,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348563058] [2021-06-11 16:26:55,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 16:26:55,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:26:55,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 16:26:55,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-11 16:26:55,198 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 182 [2021-06-11 16:26:55,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 57 transitions, 456 flow. Second operand has 7 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:55,199 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:26:55,199 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 182 [2021-06-11 16:26:55,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:26:55,335 INFO L129 PetriNetUnfolder]: 220/602 cut-off events. [2021-06-11 16:26:55,335 INFO L130 PetriNetUnfolder]: For 2009/2304 co-relation queries the response was YES. [2021-06-11 16:26:55,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2412 conditions, 602 events. 220/602 cut-off events. For 2009/2304 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 4404 event pairs, 0 based on Foata normal form. 57/561 useless extension candidates. Maximal degree in co-relation 2383. Up to 256 conditions per place. [2021-06-11 16:26:55,339 INFO L132 encePairwiseOnDemand]: 177/182 looper letters, 21 selfloop transitions, 2 changer transitions 14/66 dead transitions. [2021-06-11 16:26:55,339 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 66 transitions, 610 flow [2021-06-11 16:26:55,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 16:26:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 16:26:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 727 transitions. [2021-06-11 16:26:55,342 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6657509157509157 [2021-06-11 16:26:55,342 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 727 transitions. [2021-06-11 16:26:55,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 727 transitions. [2021-06-11 16:26:55,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:26:55,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 727 transitions. [2021-06-11 16:26:55,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:55,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:55,344 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:55,344 INFO L185 Difference]: Start difference. First operand has 85 places, 57 transitions, 456 flow. Second operand 6 states and 727 transitions. [2021-06-11 16:26:55,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 66 transitions, 610 flow [2021-06-11 16:26:55,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 66 transitions, 576 flow, removed 1 selfloop flow, removed 8 redundant places. [2021-06-11 16:26:55,363 INFO L241 Difference]: Finished difference. Result has 84 places, 52 transitions, 398 flow [2021-06-11 16:26:55,363 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=84, PETRI_TRANSITIONS=52} [2021-06-11 16:26:55,363 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 49 predicate places. [2021-06-11 16:26:55,363 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:26:55,363 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 52 transitions, 398 flow [2021-06-11 16:26:55,363 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 52 transitions, 398 flow [2021-06-11 16:26:55,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 52 transitions, 398 flow [2021-06-11 16:26:55,381 INFO L129 PetriNetUnfolder]: 64/185 cut-off events. [2021-06-11 16:26:55,381 INFO L130 PetriNetUnfolder]: For 347/354 co-relation queries the response was YES. [2021-06-11 16:26:55,382 INFO L84 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 185 events. 64/185 cut-off events. For 347/354 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1021 event pairs, 0 based on Foata normal form. 2/165 useless extension candidates. Maximal degree in co-relation 704. Up to 72 conditions per place. [2021-06-11 16:26:55,383 INFO L151 LiptonReduction]: Number of co-enabled transitions 304 [2021-06-11 16:26:55,385 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:26:55,385 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:26:55,385 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-06-11 16:26:55,386 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 52 transitions, 398 flow [2021-06-11 16:26:55,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:26:55,386 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:26:55,386 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:26:55,386 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-11 16:26:55,387 INFO L428 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:26:55,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:26:55,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1299328654, now seen corresponding path program 5 times [2021-06-11 16:26:55,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:26:55,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306522767] [2021-06-11 16:26:55,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:26:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:26:55,440 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:26:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:26:55,508 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:26:55,552 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 16:26:55,553 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 16:26:55,553 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-11 16:26:55,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 04:26:55 BasicIcfg [2021-06-11 16:26:55,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 16:26:55,630 INFO L168 Benchmark]: Toolchain (without parser) took 37892.04 ms. Allocated memory was 337.6 MB in the beginning and 1.0 GB in the end (delta: 669.0 MB). Free memory was 299.8 MB in the beginning and 517.3 MB in the end (delta: -217.5 MB). Peak memory consumption was 453.3 MB. Max. memory is 16.0 GB. [2021-06-11 16:26:55,630 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 337.6 MB. Free memory was 318.4 MB in the beginning and 318.3 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 16:26:55,630 INFO L168 Benchmark]: CACSL2BoogieTranslator took 630.42 ms. Allocated memory is still 337.6 MB. Free memory was 299.6 MB in the beginning and 293.3 MB in the end (delta: 6.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-06-11 16:26:55,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.08 ms. Allocated memory is still 337.6 MB. Free memory was 293.3 MB in the beginning and 290.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-11 16:26:55,630 INFO L168 Benchmark]: Boogie Preprocessor took 69.37 ms. Allocated memory is still 337.6 MB. Free memory was 290.1 MB in the beginning and 287.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 16:26:55,630 INFO L168 Benchmark]: RCFGBuilder took 3023.68 ms. Allocated memory was 337.6 MB in the beginning and 421.5 MB in the end (delta: 83.9 MB). Free memory was 287.0 MB in the beginning and 269.5 MB in the end (delta: 17.5 MB). Peak memory consumption was 152.7 MB. Max. memory is 16.0 GB. [2021-06-11 16:26:55,631 INFO L168 Benchmark]: TraceAbstraction took 34067.83 ms. Allocated memory was 421.5 MB in the beginning and 1.0 GB in the end (delta: 585.1 MB). Free memory was 269.5 MB in the beginning and 517.3 MB in the end (delta: -247.8 MB). Peak memory consumption was 337.3 MB. Max. memory is 16.0 GB. [2021-06-11 16:26:55,631 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 337.6 MB. Free memory was 318.4 MB in the beginning and 318.3 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 630.42 ms. Allocated memory is still 337.6 MB. Free memory was 299.6 MB in the beginning and 293.3 MB in the end (delta: 6.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 82.08 ms. Allocated memory is still 337.6 MB. Free memory was 293.3 MB in the beginning and 290.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 69.37 ms. Allocated memory is still 337.6 MB. Free memory was 290.1 MB in the beginning and 287.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 3023.68 ms. Allocated memory was 337.6 MB in the beginning and 421.5 MB in the end (delta: 83.9 MB). Free memory was 287.0 MB in the beginning and 269.5 MB in the end (delta: 17.5 MB). Peak memory consumption was 152.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 34067.83 ms. Allocated memory was 421.5 MB in the beginning and 1.0 GB in the end (delta: 585.1 MB). Free memory was 269.5 MB in the beginning and 517.3 MB in the end (delta: -247.8 MB). Peak memory consumption was 337.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17795.7ms, 102 PlacesBefore, 35 PlacesAfterwards, 94 TransitionsBefore, 27 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 85 TotalNumberOfCompositions, 4547 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1739, positive: 1588, positive conditional: 1588, positive unconditional: 0, negative: 151, negative conditional: 151, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1739, positive: 1588, positive conditional: 0, positive unconditional: 1588, negative: 151, negative conditional: 0, negative unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1739, positive: 1588, positive conditional: 0, positive unconditional: 1588, negative: 151, negative conditional: 0, negative unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1196, positive: 1150, positive conditional: 0, positive unconditional: 1150, 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: 1196, positive: 1111, positive conditional: 0, positive unconditional: 1111, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 85, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1124, positive: 158, positive conditional: 0, positive unconditional: 158, negative: 966, negative conditional: 0, negative unconditional: 966, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1739, positive: 438, positive conditional: 0, positive unconditional: 438, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 1196, unknown conditional: 0, unknown unconditional: 1196] , Statistics on independence cache: Total cache size (in pairs): 1196, Positive cache size: 1150, Positive conditional cache size: 0, Positive unconditional cache size: 1150, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 61.2ms, 32 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 268 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, positive: 50, positive conditional: 50, 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: 70, positive: 50, positive conditional: 1, positive unconditional: 49, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70, positive: 50, positive conditional: 1, positive unconditional: 49, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, positive: 28, positive conditional: 1, positive unconditional: 27, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 1220, Positive cache size: 1172, Positive conditional cache size: 0, Positive unconditional cache size: 1172, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.9ms, 32 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 244 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 1227, Positive cache size: 1179, Positive conditional cache size: 0, Positive unconditional cache size: 1179, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.8ms, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 210 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, positive: 33, positive conditional: 33, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 15, negative conditional: 0, negative unconditional: 15, 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: 48, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1227, Positive cache size: 1179, Positive conditional cache size: 0, Positive unconditional cache size: 1179, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 270.7ms, 39 PlacesBefore, 39 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, positive: 8, positive conditional: 4, positive unconditional: 4, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 4, positive unconditional: 4, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 6, positive conditional: 4, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 236, positive: 176, positive conditional: 176, positive unconditional: 0, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1235, Positive cache size: 1185, Positive conditional cache size: 4, Positive unconditional cache size: 1181, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 197.5ms, 47 PlacesBefore, 47 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 418 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 96 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, positive: 11, positive conditional: 5, positive unconditional: 6, negative: 5, negative conditional: 2, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 11, positive conditional: 5, positive unconditional: 6, negative: 5, negative conditional: 2, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 5, positive unconditional: 3, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160, positive: 59, positive conditional: 59, positive unconditional: 0, negative: 101, negative conditional: 36, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 12, unknown conditional: 7, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1247, Positive cache size: 1193, Positive conditional cache size: 9, Positive unconditional cache size: 1184, Negative cache size: 54, Negative conditional cache size: 2, Negative unconditional cache size: 52, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 249.5ms, 53 PlacesBefore, 53 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 126 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, positive: 12, positive conditional: 6, positive unconditional: 6, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, positive: 12, positive conditional: 6, positive unconditional: 6, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 212, positive: 191, positive conditional: 191, positive unconditional: 0, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1255, Positive cache size: 1199, Positive conditional cache size: 15, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41.9ms, 58 PlacesBefore, 58 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 586 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 150 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, positive: 4, positive conditional: 3, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 3, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, 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: 7, positive: 4, positive conditional: 3, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1255, Positive cache size: 1199, Positive conditional cache size: 15, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 155.8ms, 66 PlacesBefore, 66 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 682 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 171 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, 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: 24, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1258, Positive cache size: 1202, Positive conditional cache size: 18, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 96.9ms, 75 PlacesBefore, 75 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 770 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 260 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, positive: 20, positive conditional: 16, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 20, positive conditional: 16, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, 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: 24, positive: 20, positive conditional: 16, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1258, Positive cache size: 1202, Positive conditional cache size: 18, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 107.3ms, 82 PlacesBefore, 82 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 872 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 300 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, 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: 16, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1258, Positive cache size: 1202, Positive conditional cache size: 18, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 115.7ms, 86 PlacesBefore, 86 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 304 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, 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: 12, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1259, Positive cache size: 1203, Positive conditional cache size: 19, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 101.7ms, 91 PlacesBefore, 91 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 948 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 324 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, 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: 20, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1259, Positive cache size: 1203, Positive conditional cache size: 19, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 99.8ms, 94 PlacesBefore, 94 PlacesAfterwards, 121 TransitionsBefore, 121 TransitionsAfterwards, 996 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 344 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, positive: 20, positive conditional: 16, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 20, positive conditional: 16, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 18, positive conditional: 14, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1261, Positive cache size: 1205, Positive conditional cache size: 21, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 97.0ms, 97 PlacesBefore, 97 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 940 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 316 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, positive: 20, positive conditional: 12, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 20, positive conditional: 12, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, 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: 24, positive: 19, positive conditional: 11, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1262, Positive cache size: 1206, Positive conditional cache size: 22, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 131.4ms, 95 PlacesBefore, 94 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 802 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 268 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, positive: 12, positive conditional: 4, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 12, positive conditional: 4, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, 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: 16, positive: 12, positive conditional: 4, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1262, Positive cache size: 1206, Positive conditional cache size: 22, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 118.0ms, 98 PlacesBefore, 98 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 284 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1264, Positive cache size: 1208, Positive conditional cache size: 24, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 146.4ms, 100 PlacesBefore, 100 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 812 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 300 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, 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: 20, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1209, Positive conditional cache size: 25, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 149.8ms, 95 PlacesBefore, 95 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 1026 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1209, Positive conditional cache size: 25, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 175.6ms, 104 PlacesBefore, 104 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 1086 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1209, Positive conditional cache size: 25, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 113.5ms, 110 PlacesBefore, 109 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 1036 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1209, Positive conditional cache size: 25, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 84.0ms, 108 PlacesBefore, 107 PlacesAfterwards, 95 TransitionsBefore, 95 TransitionsAfterwards, 960 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1209, Positive conditional cache size: 25, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 49.2ms, 112 PlacesBefore, 107 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1209, Positive conditional cache size: 25, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.3ms, 88 PlacesBefore, 85 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1209, Positive conditional cache size: 25, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.9ms, 84 PlacesBefore, 79 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1209, Positive conditional cache size: 25, Positive unconditional cache size: 1184, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2540; [L850] FCALL, FORK 0 pthread_create(&t2540, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2541; [L852] FCALL, FORK 0 pthread_create(&t2541, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2542; [L854] FCALL, FORK 0 pthread_create(&t2542, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 33823.7ms, OverallIterations: 25, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 7760.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17891.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 84 SDtfs, 62 SDslu, 44 SDs, 0 SdLazy, 1142 SolverSat, 453 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2135.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 4001.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1748occurred in iteration=13, InterpolantAutomatonStates: 153, 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: 134.7ms SsaConstructionTime, 1004.3ms SatisfiabilityAnalysisTime, 3959.1ms InterpolantComputationTime, 391 NumberOfCodeBlocks, 391 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 346 ConstructedInterpolants, 0 QuantifiedInterpolants, 4776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...