/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-6f4246e9f5583d222ebb38ff8175c901f3a528f0-6f4246e [2021-04-29 00:42:31,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-29 00:42:31,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-29 00:42:31,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-29 00:42:31,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-29 00:42:31,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-29 00:42:31,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-29 00:42:31,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-29 00:42:31,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-29 00:42:31,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-29 00:42:31,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-29 00:42:31,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-29 00:42:31,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-29 00:42:31,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-29 00:42:31,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-29 00:42:31,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-29 00:42:31,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-29 00:42:31,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-29 00:42:31,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-29 00:42:31,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-29 00:42:31,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-29 00:42:31,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-29 00:42:31,196 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-29 00:42:31,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-29 00:42:31,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-29 00:42:31,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-29 00:42:31,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-29 00:42:31,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-29 00:42:31,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-29 00:42:31,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-29 00:42:31,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-29 00:42:31,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-29 00:42:31,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-29 00:42:31,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-29 00:42:31,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-29 00:42:31,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-29 00:42:31,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-29 00:42:31,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-29 00:42:31,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-29 00:42:31,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-29 00:42:31,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-29 00:42:31,218 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-RepeatedSemanticLbeWithPredicates.epf [2021-04-29 00:42:31,254 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-29 00:42:31,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-29 00:42:31,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-29 00:42:31,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-29 00:42:31,262 INFO L138 SettingsManager]: * Use SBE=true [2021-04-29 00:42:31,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-29 00:42:31,263 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-29 00:42:31,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-29 00:42:31,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-29 00:42:31,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-29 00:42:31,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-29 00:42:31,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-29 00:42:31,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-29 00:42:31,266 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-29 00:42:31,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-29 00:42:31,266 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-29 00:42:31,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-29 00:42:31,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-29 00:42:31,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-29 00:42:31,267 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-29 00:42:31,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-29 00:42:31,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-29 00:42:31,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-29 00:42:31,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-29 00:42:31,271 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-29 00:42:31,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-29 00:42:31,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-29 00:42:31,272 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-04-29 00:42:31,272 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-04-29 00:42:31,272 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-29 00:42:31,272 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-04-29 00:42:31,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-29 00:42:31,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-29 00:42:31,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-29 00:42:31,743 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-29 00:42:31,744 INFO L275 PluginConnector]: CDTParser initialized [2021-04-29 00:42:31,745 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-04-29 00:42:31,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/193e6a89d/f51fa63d5db9451a9065c96b373e43d4/FLAG5f2cd8ee2 [2021-04-29 00:42:32,860 INFO L306 CDTParser]: Found 1 translation units. [2021-04-29 00:42:32,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.opt.i [2021-04-29 00:42:32,886 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/193e6a89d/f51fa63d5db9451a9065c96b373e43d4/FLAG5f2cd8ee2 [2021-04-29 00:42:33,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/193e6a89d/f51fa63d5db9451a9065c96b373e43d4 [2021-04-29 00:42:33,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-29 00:42:33,122 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-29 00:42:33,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-29 00:42:33,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-29 00:42:33,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-29 00:42:33,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 12:42:33" (1/1) ... [2021-04-29 00:42:33,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@280ccb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:33, skipping insertion in model container [2021-04-29 00:42:33,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 12:42:33" (1/1) ... [2021-04-29 00:42:33,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-29 00:42:33,252 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-29 00:42:33,508 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-04-29 00:42:34,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-29 00:42:34,043 INFO L203 MainTranslator]: Completed pre-run [2021-04-29 00:42:34,057 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-04-29 00:42:34,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-29 00:42:34,284 INFO L208 MainTranslator]: Completed translation [2021-04-29 00:42:34,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:34 WrapperNode [2021-04-29 00:42:34,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-29 00:42:34,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-29 00:42:34,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-29 00:42:34,304 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-29 00:42:34,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:34" (1/1) ... [2021-04-29 00:42:34,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:34" (1/1) ... [2021-04-29 00:42:34,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-29 00:42:34,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-29 00:42:34,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-29 00:42:34,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-29 00:42:34,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:34" (1/1) ... [2021-04-29 00:42:34,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:34" (1/1) ... [2021-04-29 00:42:34,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:34" (1/1) ... [2021-04-29 00:42:34,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:34" (1/1) ... [2021-04-29 00:42:34,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:34" (1/1) ... [2021-04-29 00:42:34,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:34" (1/1) ... [2021-04-29 00:42:34,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:34" (1/1) ... [2021-04-29 00:42:34,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-29 00:42:34,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-29 00:42:34,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-29 00:42:34,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-29 00:42:34,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:34" (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-04-29 00:42:34,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-29 00:42:34,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-29 00:42:34,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-29 00:42:34,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-29 00:42:34,628 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-29 00:42:34,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-29 00:42:34,629 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-29 00:42:34,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-29 00:42:34,629 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-29 00:42:34,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-29 00:42:34,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-29 00:42:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-29 00:42:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-29 00:42:34,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-29 00:42:34,632 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-29 00:42:39,125 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-29 00:42:39,126 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-29 00:42:39,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 12:42:39 BoogieIcfgContainer [2021-04-29 00:42:39,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-29 00:42:39,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-29 00:42:39,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-29 00:42:39,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-29 00:42:39,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 12:42:33" (1/3) ... [2021-04-29 00:42:39,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f64e282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 12:42:39, skipping insertion in model container [2021-04-29 00:42:39,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:34" (2/3) ... [2021-04-29 00:42:39,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f64e282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 12:42:39, skipping insertion in model container [2021-04-29 00:42:39,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 12:42:39" (3/3) ... [2021-04-29 00:42:39,144 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_power.opt.i [2021-04-29 00:42:39,153 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-29 00:42:39,159 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-29 00:42:39,160 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-29 00:42:39,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,239 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,239 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,240 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,240 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,245 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,260 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,260 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,261 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,263 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,263 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,263 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,264 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,264 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,267 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,268 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,268 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,268 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,268 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,269 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,269 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,314 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,314 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,315 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,315 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,315 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,316 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,316 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,317 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,335 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,346 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,356 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,358 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,362 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,362 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,363 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:39,364 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-29 00:42:39,394 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-29 00:42:39,446 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-29 00:42:39,447 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-29 00:42:39,447 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-29 00:42:39,447 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-29 00:42:39,447 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-29 00:42:39,448 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-29 00:42:39,449 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-29 00:42:39,450 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-29 00:42:39,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-04-29 00:42:39,529 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-04-29 00:42:39,529 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:42:39,534 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-04-29 00:42:39,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-04-29 00:42:39,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-04-29 00:42:39,549 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:42:39,568 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-04-29 00:42:39,573 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-04-29 00:42:39,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-04-29 00:42:39,605 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-04-29 00:42:39,605 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:42:39,606 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-04-29 00:42:39,611 INFO L146 LiptonReduction]: Number of co-enabled transitions 1668 [2021-04-29 00:42:43,025 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-04-29 00:42:43,154 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:42:43,732 WARN L205 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-04-29 00:42:43,962 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-29 00:42:45,445 WARN L205 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-04-29 00:42:46,073 WARN L205 SmtUtils]: Spent 624.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-04-29 00:42:48,741 WARN L205 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2021-04-29 00:42:50,015 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 264 [2021-04-29 00:42:51,412 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-04-29 00:42:52,032 WARN L205 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-04-29 00:42:54,784 WARN L205 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-04-29 00:42:56,026 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 265 [2021-04-29 00:42:59,770 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 189 DAG size of output: 188 [2021-04-29 00:43:00,422 WARN L205 SmtUtils]: Spent 649.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-04-29 00:43:01,833 WARN L205 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 268 [2021-04-29 00:43:03,271 WARN L205 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 268 [2021-04-29 00:43:03,986 WARN L205 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-04-29 00:43:04,680 WARN L205 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-04-29 00:43:06,109 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 267 [2021-04-29 00:43:07,609 WARN L205 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 267 [2021-04-29 00:43:09,056 WARN L205 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 189 DAG size of output: 188 [2021-04-29 00:43:09,772 WARN L205 SmtUtils]: Spent 712.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-04-29 00:43:11,278 WARN L205 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 268 [2021-04-29 00:43:12,816 WARN L205 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 268 [2021-04-29 00:43:14,310 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-04-29 00:43:15,067 WARN L205 SmtUtils]: Spent 754.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-04-29 00:43:16,556 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 267 [2021-04-29 00:43:18,085 WARN L205 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 267 [2021-04-29 00:43:19,461 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 190 DAG size of output: 189 [2021-04-29 00:43:20,143 WARN L205 SmtUtils]: Spent 679.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-04-29 00:43:21,701 WARN L205 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 269 [2021-04-29 00:43:23,145 WARN L205 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 269 [2021-04-29 00:43:27,778 WARN L205 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-04-29 00:43:28,559 WARN L205 SmtUtils]: Spent 778.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-04-29 00:43:31,502 WARN L205 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 267 DAG size of output: 266 [2021-04-29 00:43:33,032 WARN L205 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 266 [2021-04-29 00:43:33,780 WARN L205 SmtUtils]: Spent 742.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-04-29 00:43:34,538 WARN L205 SmtUtils]: Spent 756.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-04-29 00:43:37,390 WARN L205 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 268 DAG size of output: 267 [2021-04-29 00:43:38,852 WARN L205 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 267 [2021-04-29 00:43:41,959 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-04-29 00:43:42,068 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:43:42,186 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-04-29 00:43:43,061 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:43:43,167 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-04-29 00:43:44,190 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:43:47,491 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:43:47,602 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:43:47,711 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:43:47,818 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:43:50,156 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:43:50,584 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:43:50,724 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:43:50,866 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:43:51,005 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:43:51,179 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:43:51,366 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:43:51,554 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:43:51,754 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:43:51,863 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:43:51,974 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:43:52,077 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:43:52,178 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:43:52,331 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:43:52,479 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:43:52,633 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:43:52,785 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:43:52,905 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:43:53,021 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:43:53,136 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:43:53,252 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:43:53,416 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:43:53,599 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:43:53,767 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:43:53,929 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:43:54,048 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:43:54,169 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:43:54,294 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:43:54,416 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:43:54,591 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:43:54,766 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:43:54,936 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:43:55,112 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:43:55,216 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:43:55,320 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:43:55,425 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:43:55,532 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:43:56,045 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:56,188 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:56,333 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:56,485 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:56,635 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:56,781 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:56,929 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:57,084 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:57,238 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:43:57,390 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:43:57,553 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:43:57,720 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:43:57,857 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:43:57,996 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:43:58,125 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:43:58,249 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:43:58,375 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:58,501 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:58,615 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:58,727 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:58,887 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-04-29 00:43:59,039 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-04-29 00:43:59,187 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-04-29 00:43:59,337 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-04-29 00:44:01,967 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-29 00:44:02,133 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-29 00:44:02,282 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-29 00:44:02,433 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-29 00:44:02,981 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:44:03,176 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:44:03,371 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:44:03,565 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:44:03,677 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:44:03,788 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:44:03,910 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:44:04,028 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:44:04,155 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:44:04,291 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:44:04,425 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:44:04,558 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:44:04,717 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:44:04,872 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:44:05,020 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:44:05,179 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:44:05,384 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:44:05,598 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:44:05,806 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:44:06,014 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:44:06,213 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:44:06,402 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:44:06,590 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:44:06,776 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:44:06,969 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:44:07,156 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:44:07,358 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:44:07,553 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:44:07,691 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:44:07,806 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:44:07,931 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:44:08,050 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:44:08,278 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:08,508 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:08,753 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:09,005 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:09,252 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:09,493 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:09,714 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:09,942 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:10,559 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2021-04-29 00:44:10,838 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-04-29 00:44:11,421 WARN L205 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2021-04-29 00:44:11,727 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-04-29 00:44:11,965 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:12,209 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:12,457 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:12,701 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:12,946 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:13,201 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:13,446 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:13,686 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:13,906 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:44:14,119 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:44:14,339 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:44:14,564 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:44:14,782 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:44:14,990 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:44:15,193 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:44:15,398 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:44:15,612 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:44:15,829 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:44:16,053 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:44:16,276 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:44:16,508 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:16,741 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:16,972 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:17,202 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:44:17,863 WARN L205 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-04-29 00:44:18,175 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-04-29 00:44:18,835 WARN L205 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-04-29 00:44:19,142 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-04-29 00:44:19,188 INFO L158 LiptonReduction]: Checked pairs total: 15353 [2021-04-29 00:44:19,189 INFO L160 LiptonReduction]: Total number of compositions: 228 [2021-04-29 00:44:19,194 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 99647 [2021-04-29 00:44:19,220 INFO L129 PetriNetUnfolder]: 1/80 cut-off events. [2021-04-29 00:44:19,220 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:44:19,220 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:19,221 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:19,222 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-04-29 00:44:19,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:19,228 INFO L82 PathProgramCache]: Analyzing trace with hash 911075325, now seen corresponding path program 1 times [2021-04-29 00:44:19,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:19,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163124172] [2021-04-29 00:44:19,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:19,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:19,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:44:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:19,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163124172] [2021-04-29 00:44:19,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:19,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:44:19,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452673331] [2021-04-29 00:44:19,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:44:19,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:19,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:44:19,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:44:19,648 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 325 [2021-04-29 00:44:19,654 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 118 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 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-04-29 00:44:19,654 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:19,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 325 [2021-04-29 00:44:19,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:20,420 INFO L129 PetriNetUnfolder]: 575/1231 cut-off events. [2021-04-29 00:44:20,420 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:44:20,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2141 conditions, 1231 events. 575/1231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8496 event pairs, 219 based on Foata normal form. 23/723 useless extension candidates. Maximal degree in co-relation 2068. Up to 661 conditions per place. [2021-04-29 00:44:20,430 INFO L132 encePairwiseOnDemand]: 306/325 looper letters, 13 selfloop transitions, 2 changer transitions 82/129 dead transitions. [2021-04-29 00:44:20,430 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 129 transitions, 361 flow [2021-04-29 00:44:20,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:44:20,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:44:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 771 transitions. [2021-04-29 00:44:20,453 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7907692307692308 [2021-04-29 00:44:20,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 771 transitions. [2021-04-29 00:44:20,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 771 transitions. [2021-04-29 00:44:20,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:20,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 771 transitions. [2021-04-29 00:44:20,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:20,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:20,480 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:20,482 INFO L185 Difference]: Start difference. First operand has 126 places, 118 transitions, 245 flow. Second operand 3 states and 771 transitions. [2021-04-29 00:44:20,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 129 transitions, 361 flow [2021-04-29 00:44:20,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 129 transitions, 358 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-04-29 00:44:20,491 INFO L241 Difference]: Finished difference. Result has 122 places, 41 transitions, 92 flow [2021-04-29 00:44:20,493 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=122, PETRI_TRANSITIONS=41} [2021-04-29 00:44:20,494 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -4 predicate places. [2021-04-29 00:44:20,495 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:20,495 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 41 transitions, 92 flow [2021-04-29 00:44:20,495 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 41 transitions, 92 flow [2021-04-29 00:44:20,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 92 flow [2021-04-29 00:44:20,503 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-04-29 00:44:20,503 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:44:20,503 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 127 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-04-29 00:44:20,505 INFO L146 LiptonReduction]: Number of co-enabled transitions 932 [2021-04-29 00:44:20,651 INFO L158 LiptonReduction]: Checked pairs total: 904 [2021-04-29 00:44:20,651 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:20,651 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 156 [2021-04-29 00:44:20,654 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2021-04-29 00:44:20,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 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-04-29 00:44:20,654 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:20,655 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:20,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-29 00:44:20,655 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-04-29 00:44:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:20,655 INFO L82 PathProgramCache]: Analyzing trace with hash -629871503, now seen corresponding path program 1 times [2021-04-29 00:44:20,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:20,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740059424] [2021-04-29 00:44:20,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:20,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:20,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:44:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:20,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740059424] [2021-04-29 00:44:20,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:20,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:44:20,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663449601] [2021-04-29 00:44:20,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:44:20,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:20,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:44:20,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:44:20,803 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 325 [2021-04-29 00:44:20,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 261.6666666666667) internal successors, (785), 3 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:20,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:20,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 325 [2021-04-29 00:44:20,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:20,831 INFO L129 PetriNetUnfolder]: 3/55 cut-off events. [2021-04-29 00:44:20,832 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:44:20,833 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 55 events. 3/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 189 event pairs, 1 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 67. Up to 10 conditions per place. [2021-04-29 00:44:20,834 INFO L132 encePairwiseOnDemand]: 321/325 looper letters, 3 selfloop transitions, 3 changer transitions 2/43 dead transitions. [2021-04-29 00:44:20,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 108 flow [2021-04-29 00:44:20,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:44:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:44:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2021-04-29 00:44:20,839 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8102564102564103 [2021-04-29 00:44:20,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 790 transitions. [2021-04-29 00:44:20,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 790 transitions. [2021-04-29 00:44:20,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:20,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 790 transitions. [2021-04-29 00:44:20,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:20,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:20,849 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:20,850 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 790 transitions. [2021-04-29 00:44:20,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 108 flow [2021-04-29 00:44:20,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:44:20,853 INFO L241 Difference]: Finished difference. Result has 51 places, 41 transitions, 103 flow [2021-04-29 00:44:20,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2021-04-29 00:44:20,854 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -75 predicate places. [2021-04-29 00:44:20,854 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:20,854 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 41 transitions, 103 flow [2021-04-29 00:44:20,855 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 41 transitions, 103 flow [2021-04-29 00:44:20,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 103 flow [2021-04-29 00:44:20,878 INFO L129 PetriNetUnfolder]: 3/53 cut-off events. [2021-04-29 00:44:20,878 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:44:20,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 53 events. 3/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 175 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 66. Up to 10 conditions per place. [2021-04-29 00:44:20,880 INFO L146 LiptonReduction]: Number of co-enabled transitions 946 [2021-04-29 00:44:20,884 INFO L158 LiptonReduction]: Checked pairs total: 811 [2021-04-29 00:44:20,885 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:20,885 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-04-29 00:44:20,886 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 103 flow [2021-04-29 00:44:20,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 261.6666666666667) internal successors, (785), 3 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:20,887 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:20,888 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:20,888 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-29 00:44:20,888 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-04-29 00:44:20,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:20,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2112877338, now seen corresponding path program 1 times [2021-04-29 00:44:20,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:20,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862488912] [2021-04-29 00:44:20,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:20,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:20,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:44:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:20,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862488912] [2021-04-29 00:44:20,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:20,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:44:20,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107553299] [2021-04-29 00:44:20,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:44:20,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:20,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:44:20,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:44:21,001 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 325 [2021-04-29 00:44:21,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:21,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:21,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 325 [2021-04-29 00:44:21,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:21,035 INFO L129 PetriNetUnfolder]: 3/53 cut-off events. [2021-04-29 00:44:21,036 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-04-29 00:44:21,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 53 events. 3/53 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 182 event pairs, 1 based on Foata normal form. 2/33 useless extension candidates. Maximal degree in co-relation 70. Up to 10 conditions per place. [2021-04-29 00:44:21,037 INFO L132 encePairwiseOnDemand]: 322/325 looper letters, 1 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2021-04-29 00:44:21,037 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 109 flow [2021-04-29 00:44:21,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:44:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:44:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2021-04-29 00:44:21,041 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6964102564102564 [2021-04-29 00:44:21,042 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2021-04-29 00:44:21,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2021-04-29 00:44:21,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:21,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2021-04-29 00:44:21,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:21,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:21,049 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:21,049 INFO L185 Difference]: Start difference. First operand has 49 places, 41 transitions, 103 flow. Second operand 3 states and 679 transitions. [2021-04-29 00:44:21,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 109 flow [2021-04-29 00:44:21,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 41 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-29 00:44:21,052 INFO L241 Difference]: Finished difference. Result has 51 places, 41 transitions, 108 flow [2021-04-29 00:44:21,052 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2021-04-29 00:44:21,052 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -75 predicate places. [2021-04-29 00:44:21,052 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:21,053 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 41 transitions, 108 flow [2021-04-29 00:44:21,056 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 41 transitions, 108 flow [2021-04-29 00:44:21,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 108 flow [2021-04-29 00:44:21,067 INFO L129 PetriNetUnfolder]: 3/53 cut-off events. [2021-04-29 00:44:21,067 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-04-29 00:44:21,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 53 events. 3/53 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 177 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 69. Up to 10 conditions per place. [2021-04-29 00:44:21,069 INFO L146 LiptonReduction]: Number of co-enabled transitions 938 [2021-04-29 00:44:21,152 INFO L158 LiptonReduction]: Checked pairs total: 749 [2021-04-29 00:44:21,152 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:21,153 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 101 [2021-04-29 00:44:21,154 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 108 flow [2021-04-29 00:44:21,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:21,156 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:21,156 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:21,157 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-29 00:44:21,157 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-04-29 00:44:21,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:21,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1067289564, now seen corresponding path program 1 times [2021-04-29 00:44:21,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:21,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594938657] [2021-04-29 00:44:21,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:21,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:21,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-29 00:44:21,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:21,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-04-29 00:44:21,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:21,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:44:21,477 INFO L142 QuantifierPusher]: treesize reduction 11, result has 71.8 percent of original size [2021-04-29 00:44:21,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-04-29 00:44:21,541 INFO L142 QuantifierPusher]: treesize reduction 8, result has 79.5 percent of original size [2021-04-29 00:44:21,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-04-29 00:44:21,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:21,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594938657] [2021-04-29 00:44:21,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:21,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:44:21,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180199717] [2021-04-29 00:44:21,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-29 00:44:21,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:21,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-29 00:44:21,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-04-29 00:44:21,610 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 325 [2021-04-29 00:44:21,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 108 flow. Second operand has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:21,612 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:21,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 325 [2021-04-29 00:44:21,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:22,105 INFO L129 PetriNetUnfolder]: 154/439 cut-off events. [2021-04-29 00:44:22,105 INFO L130 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2021-04-29 00:44:22,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 439 events. 154/439 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2822 event pairs, 12 based on Foata normal form. 8/343 useless extension candidates. Maximal degree in co-relation 787. Up to 184 conditions per place. [2021-04-29 00:44:22,111 INFO L132 encePairwiseOnDemand]: 319/325 looper letters, 17 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2021-04-29 00:44:22,111 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 198 flow [2021-04-29 00:44:22,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:44:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:44:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 814 transitions. [2021-04-29 00:44:22,117 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5009230769230769 [2021-04-29 00:44:22,117 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 814 transitions. [2021-04-29 00:44:22,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 814 transitions. [2021-04-29 00:44:22,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:22,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 814 transitions. [2021-04-29 00:44:22,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:22,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:22,127 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:22,127 INFO L185 Difference]: Start difference. First operand has 51 places, 41 transitions, 108 flow. Second operand 5 states and 814 transitions. [2021-04-29 00:44:22,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 198 flow [2021-04-29 00:44:22,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:44:22,130 INFO L241 Difference]: Finished difference. Result has 56 places, 48 transitions, 163 flow [2021-04-29 00:44:22,130 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2021-04-29 00:44:22,131 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -70 predicate places. [2021-04-29 00:44:22,131 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:22,131 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 48 transitions, 163 flow [2021-04-29 00:44:22,131 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 48 transitions, 163 flow [2021-04-29 00:44:22,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 163 flow [2021-04-29 00:44:22,156 INFO L129 PetriNetUnfolder]: 13/118 cut-off events. [2021-04-29 00:44:22,156 INFO L130 PetriNetUnfolder]: For 109/122 co-relation queries the response was YES. [2021-04-29 00:44:22,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 118 events. 13/118 cut-off events. For 109/122 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 621 event pairs, 2 based on Foata normal form. 1/80 useless extension candidates. Maximal degree in co-relation 203. Up to 21 conditions per place. [2021-04-29 00:44:22,160 INFO L146 LiptonReduction]: Number of co-enabled transitions 1164 [2021-04-29 00:44:22,502 INFO L158 LiptonReduction]: Checked pairs total: 498 [2021-04-29 00:44:22,502 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:22,502 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 371 [2021-04-29 00:44:22,504 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 163 flow [2021-04-29 00:44:22,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:22,505 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:22,505 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:22,505 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-29 00:44:22,505 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-04-29 00:44:22,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:22,506 INFO L82 PathProgramCache]: Analyzing trace with hash -380214917, now seen corresponding path program 1 times [2021-04-29 00:44:22,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:22,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463452994] [2021-04-29 00:44:22,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:22,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:22,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:44:22,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:22,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:44:22,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:22,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-29 00:44:22,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:22,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-29 00:44:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:22,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463452994] [2021-04-29 00:44:22,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:22,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:44:22,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663919279] [2021-04-29 00:44:22,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:44:22,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:22,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:44:22,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:44:22,701 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 325 [2021-04-29 00:44:22,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 169.4) internal successors, (847), 5 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:22,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:22,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 325 [2021-04-29 00:44:22,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:23,052 INFO L129 PetriNetUnfolder]: 169/455 cut-off events. [2021-04-29 00:44:23,052 INFO L130 PetriNetUnfolder]: For 378/386 co-relation queries the response was YES. [2021-04-29 00:44:23,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 455 events. 169/455 cut-off events. For 378/386 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2883 event pairs, 15 based on Foata normal form. 10/365 useless extension candidates. Maximal degree in co-relation 1016. Up to 190 conditions per place. [2021-04-29 00:44:23,058 INFO L132 encePairwiseOnDemand]: 316/325 looper letters, 15 selfloop transitions, 18 changer transitions 0/64 dead transitions. [2021-04-29 00:44:23,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 281 flow [2021-04-29 00:44:23,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:44:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:44:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1038 transitions. [2021-04-29 00:44:23,065 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5323076923076923 [2021-04-29 00:44:23,065 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1038 transitions. [2021-04-29 00:44:23,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1038 transitions. [2021-04-29 00:44:23,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:23,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1038 transitions. [2021-04-29 00:44:23,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:23,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:23,076 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:23,076 INFO L185 Difference]: Start difference. First operand has 56 places, 48 transitions, 163 flow. Second operand 6 states and 1038 transitions. [2021-04-29 00:44:23,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 281 flow [2021-04-29 00:44:23,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 281 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-04-29 00:44:23,081 INFO L241 Difference]: Finished difference. Result has 64 places, 59 transitions, 283 flow [2021-04-29 00:44:23,081 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2021-04-29 00:44:23,081 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -62 predicate places. [2021-04-29 00:44:23,082 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:23,082 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 59 transitions, 283 flow [2021-04-29 00:44:23,082 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 59 transitions, 283 flow [2021-04-29 00:44:23,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 59 transitions, 283 flow [2021-04-29 00:44:23,167 INFO L129 PetriNetUnfolder]: 106/352 cut-off events. [2021-04-29 00:44:23,167 INFO L130 PetriNetUnfolder]: For 540/564 co-relation queries the response was YES. [2021-04-29 00:44:23,170 INFO L84 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 352 events. 106/352 cut-off events. For 540/564 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2326 event pairs, 43 based on Foata normal form. 2/239 useless extension candidates. Maximal degree in co-relation 894. Up to 116 conditions per place. [2021-04-29 00:44:23,178 INFO L146 LiptonReduction]: Number of co-enabled transitions 1448 [2021-04-29 00:44:23,235 INFO L158 LiptonReduction]: Checked pairs total: 170 [2021-04-29 00:44:23,235 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:23,236 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 154 [2021-04-29 00:44:23,237 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 283 flow [2021-04-29 00:44:23,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 169.4) internal successors, (847), 5 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:23,238 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:23,238 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:23,238 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-29 00:44:23,239 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-04-29 00:44:23,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:23,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1382326019, now seen corresponding path program 2 times [2021-04-29 00:44:23,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:23,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622313645] [2021-04-29 00:44:23,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:23,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:23,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:44:23,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:23,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:44:23,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:23,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:44:23,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:23,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:44:23,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:23,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-04-29 00:44:23,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:23,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:44:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:23,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622313645] [2021-04-29 00:44:23,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:23,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:44:23,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604081301] [2021-04-29 00:44:23,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-29 00:44:23,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:23,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-29 00:44:23,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-04-29 00:44:23,483 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 325 [2021-04-29 00:44:23,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 283 flow. Second operand has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:23,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:23,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 325 [2021-04-29 00:44:23,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:24,020 INFO L129 PetriNetUnfolder]: 201/518 cut-off events. [2021-04-29 00:44:24,020 INFO L130 PetriNetUnfolder]: For 856/888 co-relation queries the response was YES. [2021-04-29 00:44:24,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 518 events. 201/518 cut-off events. For 856/888 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3401 event pairs, 6 based on Foata normal form. 27/432 useless extension candidates. Maximal degree in co-relation 1534. Up to 210 conditions per place. [2021-04-29 00:44:24,029 INFO L132 encePairwiseOnDemand]: 316/325 looper letters, 23 selfloop transitions, 28 changer transitions 0/82 dead transitions. [2021-04-29 00:44:24,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 82 transitions, 497 flow [2021-04-29 00:44:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:44:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:44:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1222 transitions. [2021-04-29 00:44:24,035 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2021-04-29 00:44:24,036 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1222 transitions. [2021-04-29 00:44:24,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1222 transitions. [2021-04-29 00:44:24,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:24,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1222 transitions. [2021-04-29 00:44:24,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 174.57142857142858) internal successors, (1222), 7 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:24,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 325.0) internal successors, (2600), 8 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:24,046 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 325.0) internal successors, (2600), 8 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:24,046 INFO L185 Difference]: Start difference. First operand has 64 places, 59 transitions, 283 flow. Second operand 7 states and 1222 transitions. [2021-04-29 00:44:24,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 82 transitions, 497 flow [2021-04-29 00:44:24,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 82 transitions, 480 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-04-29 00:44:24,054 INFO L241 Difference]: Finished difference. Result has 71 places, 70 transitions, 418 flow [2021-04-29 00:44:24,054 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=418, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2021-04-29 00:44:24,054 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -55 predicate places. [2021-04-29 00:44:24,054 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:24,055 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 70 transitions, 418 flow [2021-04-29 00:44:24,055 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 70 transitions, 418 flow [2021-04-29 00:44:24,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 70 transitions, 418 flow [2021-04-29 00:44:24,146 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1697] L865-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse17 (= (mod v_~x$r_buff1_thd0~0_298 256) 0)) (.cse18 (= (mod v_~x$w_buff1_used~0_764 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd0~0_356 256) 0))) (let ((.cse1 (= (mod v_~weak$$choice2~0_286 256) 0)) (.cse9 (not .cse10)) (.cse19 (= (mod v_~x$w_buff0_used~0_980 256) 0)) (.cse13 (and .cse10 .cse18)) (.cse14 (and .cse10 .cse17))) (let ((.cse5 (or .cse19 .cse13 .cse14)) (.cse6 (not .cse19)) (.cse7 (or .cse9 (not .cse18))) (.cse8 (or (not .cse17) .cse9)) (.cse2 (not .cse1))) (and (= (mod v_~main$tmp_guard1~0_42 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_25|) (= |v_ULTIMATE.start_main_#t~nondet78_69| v_~weak$$choice0~0_81) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite94_126| |v_ULTIMATE.start_main_#t~ite94_125|))) (or (and (= v_~x$r_buff0_thd0~0_355 |v_ULTIMATE.start_main_#t~ite95_122|) (= v_~x$r_buff0_thd0~0_356 |v_ULTIMATE.start_main_#t~ite95_122|) .cse0 .cse1) (and (= v_~x$r_buff0_thd0~0_356 v_~x$r_buff0_thd0~0_355) (= |v_ULTIMATE.start_main_#t~ite95_121| |v_ULTIMATE.start_main_#t~ite95_122|) .cse2 .cse0))) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~ite97_114| |v_ULTIMATE.start_main_#t~ite97_113|))) (or (and .cse3 (= |v_ULTIMATE.start_main_#t~ite98_108| |v_ULTIMATE.start_main_#t~ite98_107|) .cse2 (= v_~x$r_buff1_thd0~0_298 v_~x$r_buff1_thd0~0_297)) (and (= v_~x$r_buff1_thd0~0_298 |v_ULTIMATE.start_main_#t~ite98_108|) .cse3 .cse1 (= v_~x$r_buff1_thd0~0_297 |v_ULTIMATE.start_main_#t~ite98_108|)))) (let ((.cse4 (= |v_ULTIMATE.start_main_#t~ite82_126| |v_ULTIMATE.start_main_#t~ite82_125|))) (or (and (= |v_ULTIMATE.start_main_#t~ite83_119| |v_ULTIMATE.start_main_#t~ite83_120|) .cse2 (= v_~x$w_buff0~0_359 v_~x$w_buff0~0_358) .cse4) (and (or (and .cse5 (= v_~x$w_buff0~0_359 |v_ULTIMATE.start_main_#t~ite83_120|) .cse4) (and (= v_~x$w_buff0~0_359 |v_ULTIMATE.start_main_#t~ite82_126|) (= |v_ULTIMATE.start_main_#t~ite82_126| |v_ULTIMATE.start_main_#t~ite83_120|) .cse6 .cse7 .cse8)) (= v_~x$w_buff0~0_358 |v_ULTIMATE.start_main_#t~ite83_120|) .cse1))) (or (and (= v_~x~0_476 v_~x~0_474) .cse1) (and .cse2 (= v_~x~0_474 v_~x$mem_tmp~0_100))) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_64 0) (= v_~y~0_61 2) (= v_~__unbuffered_p1_EAX~0_60 1) (= 2 v_~x~0_476))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_42) (= v_~x~0_475 v_~x$mem_tmp~0_100) (= v_ULTIMATE.start___VERIFIER_assert_~expression_29 0) (= v_~x$flush_delayed~0_150 0) (or (and (or (and .cse9 (= v_~x$w_buff0~0_359 |v_ULTIMATE.start_main_#t~ite80_108|)) (and .cse10 (= v_~x$w_buff1~0_340 |v_ULTIMATE.start_main_#t~ite80_108|))) (= |v_ULTIMATE.start_main_#t~ite80_108| v_~x~0_476) .cse6 .cse7 .cse8) (and (= |v_ULTIMATE.start_main_#t~ite80_108| |v_ULTIMATE.start_main_#t~ite80_107|) .cse5 (= v_~x~0_476 v_~x~0_475))) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite88_119| |v_ULTIMATE.start_main_#t~ite88_120|))) (or (and (or (and (= v_~x$w_buff0_used~0_980 |v_ULTIMATE.start_main_#t~ite89_108|) .cse5 .cse11) (and (= |v_ULTIMATE.start_main_#t~ite88_120| |v_ULTIMATE.start_main_#t~ite89_108|) .cse6 .cse7 (or (and .cse10 (= v_~x$w_buff0_used~0_980 |v_ULTIMATE.start_main_#t~ite88_120|)) (and .cse9 (= |v_ULTIMATE.start_main_#t~ite88_120| 0))) .cse8)) (= v_~x$w_buff0_used~0_979 |v_ULTIMATE.start_main_#t~ite89_108|) .cse1) (and (= v_~x$w_buff0_used~0_980 v_~x$w_buff0_used~0_979) (= |v_ULTIMATE.start_main_#t~ite89_108| |v_ULTIMATE.start_main_#t~ite89_107|) .cse2 .cse11))) (let ((.cse15 (= |v_ULTIMATE.start_main_#t~ite91_106| |v_ULTIMATE.start_main_#t~ite91_105|))) (or (and (let ((.cse12 (= (mod v_~x$w_buff0_used~0_979 256) 0))) (or (and (= v_~x$w_buff1_used~0_764 |v_ULTIMATE.start_main_#t~ite92_102|) (or .cse12 .cse13 .cse14) .cse15) (and (= |v_ULTIMATE.start_main_#t~ite91_106| |v_ULTIMATE.start_main_#t~ite92_102|) (not .cse12) (= |v_ULTIMATE.start_main_#t~ite91_106| 0) .cse7 .cse8))) (= v_~x$w_buff1_used~0_763 |v_ULTIMATE.start_main_#t~ite92_102|) .cse1) (and .cse2 .cse15 (= |v_ULTIMATE.start_main_#t~ite92_102| |v_ULTIMATE.start_main_#t~ite92_101|) (= v_~x$w_buff1_used~0_764 v_~x$w_buff1_used~0_763)))) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite85_110| |v_ULTIMATE.start_main_#t~ite85_109|))) (or (and (or (and (= v_~x$w_buff1~0_340 |v_ULTIMATE.start_main_#t~ite86_104|) .cse5 .cse16) (and (= |v_ULTIMATE.start_main_#t~ite85_110| |v_ULTIMATE.start_main_#t~ite86_104|) (= v_~x$w_buff1~0_340 |v_ULTIMATE.start_main_#t~ite85_110|) .cse6 .cse7 .cse8)) (= v_~x$w_buff1~0_339 |v_ULTIMATE.start_main_#t~ite86_104|) .cse1) (and (= v_~x$w_buff1~0_339 v_~x$w_buff1~0_340) .cse2 (= |v_ULTIMATE.start_main_#t~ite86_104| |v_ULTIMATE.start_main_#t~ite86_103|) .cse16))) (= v_~weak$$choice2~0_286 |v_ULTIMATE.start_main_#t~nondet79_73|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_29 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_25|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_359, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_73|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_69|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_107|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_119|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_103|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_121|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_125|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_101|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_105|, ~y~0=v_~y~0_61, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_356, ~x$w_buff1~0=v_~x$w_buff1~0_340, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_764, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_298, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_107|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_113|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_980, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_109|, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_119|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_125|, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_107|, ~x~0=v_~x~0_475} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_358, ~x$flush_delayed~0=v_~x$flush_delayed~0_150, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_72|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_68|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_100, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_106|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_118|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_64|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_102|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_58|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_120|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_124|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_29, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_66|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_100|, ULTIMATE.start_main_#t~ite100=|v_ULTIMATE.start_main_#t~ite100_54|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_104|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_58|, ~y~0=v_~y~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_355, ~x$w_buff1~0=v_~x$w_buff1~0_339, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_763, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ULTIMATE.start_main_#t~ite99=|v_ULTIMATE.start_main_#t~ite99_58|, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_106|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_112|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_979, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_108|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_58|, ~weak$$choice0~0=v_~weak$$choice0~0_81, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_118|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_124|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_54|, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_106|, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~x~0=v_~x~0_474} AuxVars[|v_ULTIMATE.start_main_#t~ite89_108|, |v_ULTIMATE.start_main_#t~ite85_110|, |v_ULTIMATE.start_main_#t~ite92_102|, |v_ULTIMATE.start_main_#t~ite91_106|, |v_ULTIMATE.start_main_#t~ite82_126|, |v_ULTIMATE.start_main_#t~ite95_122|, |v_ULTIMATE.start_main_#t~ite80_108|, |v_ULTIMATE.start_main_#t~ite98_108|, |v_ULTIMATE.start_main_#t~ite86_104|, v_~x~0_476, |v_ULTIMATE.start_main_#t~ite97_114|, |v_ULTIMATE.start_main_#t~ite88_120|, |v_ULTIMATE.start_main_#t~ite83_120|, |v_ULTIMATE.start_main_#t~ite94_126|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet79, ULTIMATE.start_main_#t~nondet78, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite96, ULTIMATE.start_main_#t~ite95, ULTIMATE.start_main_#t~ite94, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~ite100, ULTIMATE.start_main_#t~ite91, ULTIMATE.start_main_#t~ite90, ULTIMATE.start___VERIFIER_assert_#in~expression, ~x$r_buff0_thd0~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite99, ULTIMATE.start_main_#t~ite98, ULTIMATE.start_main_#t~ite97, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite82, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#t~ite80, ~weak$$choice2~0, ~x~0][23], [Black: 251#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 252#(and (or (= ~x~0 1) (not (= ~__unbuffered_p1_EAX~0 1))) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), 6#L832true, Black: 227#(and (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 1) (= ~x~0 ~__unbuffered_p1_EAX~0)) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0)), P2Thread1of1ForFork2InUse, Black: 229#(and (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0) (or (= ~x~0 1) (= ~x~0 ~__unbuffered_p1_EAX~0) (= ~x~0 ~x$w_buff0~0))), Black: 222#(and (= ~x~0 1) (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0)), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 46#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 207#(= ~y~0 0), Black: 242#(and (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (or (= ~x~0 ~__unbuffered_p1_EAX~0) (= ~__unbuffered_p1_EAX~0 0)) (= 0 ~x$w_buff0~0)), Black: 236#(and (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$w_buff0~0)), 86#L761true, Black: 212#(= ~__unbuffered_p1_EAX~0 0), Black: 238#(and (= 0 ~x$r_buff0_thd0~0) (or (= ~x~0 ~__unbuffered_p1_EAX~0) (= ~__unbuffered_p1_EAX~0 0)) (= ~x$r_buff1_thd0~0 0)), 247#true, 58#L796true, 219#true]) [2021-04-29 00:44:24,146 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-04-29 00:44:24,146 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-04-29 00:44:24,146 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-04-29 00:44:24,146 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-04-29 00:44:24,147 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L796-->L803: Formula: (let ((.cse6 (= (mod v_~x$r_buff1_thd2~0_167 256) 0)) (.cse12 (= (mod v_~x$w_buff1_used~0_386 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_577 256) 0)) (.cse13 (= 0 (mod v_~x$r_buff0_thd2~0_236 256))) (.cse14 (= (mod v_~x$w_buff0_used~0_578 256) 0))) (let ((.cse8 (not .cse14)) (.cse11 (or .cse13 .cse14)) (.cse0 (or .cse13 .cse7)) (.cse10 (or .cse6 .cse12)) (.cse1 (not .cse7)) (.cse2 (not .cse13)) (.cse9 (not .cse12)) (.cse3 (not .cse6))) (and (or (and .cse0 (= v_~x$r_buff0_thd2~0_236 v_~x$r_buff0_thd2~0_235)) (and .cse1 .cse2 (= v_~x$r_buff0_thd2~0_235 0))) (let ((.cse4 (= (mod v_~x$w_buff1_used~0_385 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd2~0_235 256) 0))) (or (and (or (and .cse3 (not .cse4)) (and .cse1 (not .cse5))) (= v_~x$r_buff1_thd2~0_166 0)) (and (= v_~x$r_buff1_thd2~0_167 v_~x$r_buff1_thd2~0_166) (or .cse6 .cse4) (or .cse7 .cse5)))) (or (and .cse2 (= v_~x$w_buff0~0_156 v_~x~0_167) (= |v_P1_#t~ite57_35| |v_P1Thread1of1ForFork1_#t~ite57_1|) .cse8) (and (or (and .cse9 .cse3 (= |v_P1_#t~ite57_35| v_~x$w_buff1~0_127)) (and .cse10 (= |v_P1_#t~ite57_35| v_~x~0_168))) (= |v_P1_#t~ite57_35| v_~x~0_167) .cse11)) (or (and .cse2 (= v_~x$w_buff0_used~0_577 0) .cse8) (and (= v_~x$w_buff0_used~0_578 v_~x$w_buff0_used~0_577) .cse11)) (or (and .cse0 (= v_~x$w_buff1_used~0_386 v_~x$w_buff1_used~0_385) .cse10) (and (or (and .cse1 .cse2) (and .cse9 .cse3)) (= v_~x$w_buff1_used~0_385 0)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_127, P1Thread1of1ForFork1_#t~ite57=|v_P1Thread1of1ForFork1_#t~ite57_1|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_167, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_386, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_236, ~x~0=v_~x~0_168, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_578} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_127, P1Thread1of1ForFork1_#t~ite57=|v_P1Thread1of1ForFork1_#t~ite57_2|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_166, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_385, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_235, P1Thread1of1ForFork1_#t~ite59=|v_P1Thread1of1ForFork1_#t~ite59_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_577, P1Thread1of1ForFork1_#t~ite58=|v_P1Thread1of1ForFork1_#t~ite58_1|, P1Thread1of1ForFork1_#t~ite61=|v_P1Thread1of1ForFork1_#t~ite61_1|, P1Thread1of1ForFork1_#t~ite62=|v_P1Thread1of1ForFork1_#t~ite62_1|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_1|, ~x~0=v_~x~0_167} AuxVars[|v_P1_#t~ite57_35|] AssignedVars[P1Thread1of1ForFork1_#t~ite61, P1Thread1of1ForFork1_#t~ite62, P1Thread1of1ForFork1_#t~ite60, P1Thread1of1ForFork1_#t~ite57, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, P1Thread1of1ForFork1_#t~ite59, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite58][60], [Black: 251#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 252#(and (or (= ~x~0 1) (not (= ~__unbuffered_p1_EAX~0 1))) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), 6#L832true, Black: 227#(and (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 1) (= ~x~0 ~__unbuffered_p1_EAX~0)) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0)), P2Thread1of1ForFork2InUse, Black: 229#(and (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0) (or (= ~x~0 1) (= ~x~0 ~__unbuffered_p1_EAX~0) (= ~x~0 ~x$w_buff0~0))), Black: 222#(and (= ~x~0 1) (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0)), 42#L865true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 12#L803true, Black: 207#(= ~y~0 0), Black: 242#(and (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (or (= ~x~0 ~__unbuffered_p1_EAX~0) (= ~__unbuffered_p1_EAX~0 0)) (= 0 ~x$w_buff0~0)), Black: 236#(and (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$w_buff0~0)), Black: 212#(= ~__unbuffered_p1_EAX~0 0), Black: 238#(and (= 0 ~x$r_buff0_thd0~0) (or (= ~x~0 ~__unbuffered_p1_EAX~0) (= ~__unbuffered_p1_EAX~0 0)) (= ~x$r_buff1_thd0~0 0)), 86#L761true, 247#true, 219#true]) [2021-04-29 00:44:24,147 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-04-29 00:44:24,147 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-04-29 00:44:24,147 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-04-29 00:44:24,147 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-04-29 00:44:24,157 INFO L129 PetriNetUnfolder]: 134/415 cut-off events. [2021-04-29 00:44:24,157 INFO L130 PetriNetUnfolder]: For 1164/1217 co-relation queries the response was YES. [2021-04-29 00:44:24,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 415 events. 134/415 cut-off events. For 1164/1217 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2791 event pairs, 28 based on Foata normal form. 7/304 useless extension candidates. Maximal degree in co-relation 1295. Up to 148 conditions per place. [2021-04-29 00:44:24,170 INFO L146 LiptonReduction]: Number of co-enabled transitions 1784 [2021-04-29 00:44:24,186 INFO L158 LiptonReduction]: Checked pairs total: 100 [2021-04-29 00:44:24,186 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:24,186 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 132 [2021-04-29 00:44:24,188 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 418 flow [2021-04-29 00:44:24,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:24,189 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:24,190 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:24,190 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-29 00:44:24,190 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-04-29 00:44:24,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:24,190 INFO L82 PathProgramCache]: Analyzing trace with hash -330851605, now seen corresponding path program 3 times [2021-04-29 00:44:24,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:24,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876683460] [2021-04-29 00:44:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:24,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:24,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:44:24,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:24,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:44:24,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:24,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-04-29 00:44:24,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:24,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-04-29 00:44:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:24,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876683460] [2021-04-29 00:44:24,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:24,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:44:24,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216717303] [2021-04-29 00:44:24,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:44:24,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:24,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:44:24,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:44:24,509 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 325 [2021-04-29 00:44:24,511 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 418 flow. Second operand has 5 states, 5 states have (on average 169.4) internal successors, (847), 5 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:24,511 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:24,511 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 325 [2021-04-29 00:44:24,511 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:24,921 INFO L129 PetriNetUnfolder]: 204/539 cut-off events. [2021-04-29 00:44:24,921 INFO L130 PetriNetUnfolder]: For 1288/1324 co-relation queries the response was YES. [2021-04-29 00:44:24,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1901 conditions, 539 events. 204/539 cut-off events. For 1288/1324 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3636 event pairs, 15 based on Foata normal form. 14/435 useless extension candidates. Maximal degree in co-relation 1878. Up to 240 conditions per place. [2021-04-29 00:44:24,931 INFO L132 encePairwiseOnDemand]: 317/325 looper letters, 30 selfloop transitions, 20 changer transitions 0/81 dead transitions. [2021-04-29 00:44:24,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 81 transitions, 591 flow [2021-04-29 00:44:24,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:44:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:44:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1034 transitions. [2021-04-29 00:44:24,938 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5302564102564102 [2021-04-29 00:44:24,938 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1034 transitions. [2021-04-29 00:44:24,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1034 transitions. [2021-04-29 00:44:24,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:24,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1034 transitions. [2021-04-29 00:44:24,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.33333333333334) internal successors, (1034), 6 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-04-29 00:44:24,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:24,948 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:24,948 INFO L185 Difference]: Start difference. First operand has 71 places, 70 transitions, 418 flow. Second operand 6 states and 1034 transitions. [2021-04-29 00:44:24,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 81 transitions, 591 flow [2021-04-29 00:44:24,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 81 transitions, 564 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-04-29 00:44:24,957 INFO L241 Difference]: Finished difference. Result has 74 places, 76 transitions, 504 flow [2021-04-29 00:44:24,957 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2021-04-29 00:44:24,958 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -52 predicate places. [2021-04-29 00:44:24,958 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:24,958 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 76 transitions, 504 flow [2021-04-29 00:44:24,958 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 76 transitions, 504 flow [2021-04-29 00:44:24,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 76 transitions, 504 flow [2021-04-29 00:44:25,065 INFO L129 PetriNetUnfolder]: 136/401 cut-off events. [2021-04-29 00:44:25,065 INFO L130 PetriNetUnfolder]: For 1211/1244 co-relation queries the response was YES. [2021-04-29 00:44:25,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 401 events. 136/401 cut-off events. For 1211/1244 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2604 event pairs, 24 based on Foata normal form. 11/306 useless extension candidates. Maximal degree in co-relation 1426. Up to 148 conditions per place. [2021-04-29 00:44:25,078 INFO L146 LiptonReduction]: Number of co-enabled transitions 1940 [2021-04-29 00:44:25,087 INFO L158 LiptonReduction]: Checked pairs total: 110 [2021-04-29 00:44:25,087 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:25,088 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 130 [2021-04-29 00:44:25,089 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 504 flow [2021-04-29 00:44:25,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 169.4) internal successors, (847), 5 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:25,090 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:25,090 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:25,090 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-29 00:44:25,090 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-04-29 00:44:25,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:25,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1551257763, now seen corresponding path program 1 times [2021-04-29 00:44:25,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:25,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454923124] [2021-04-29 00:44:25,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:25,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:25,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:44:25,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:25,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:44:25,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:25,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:44:25,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:25,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-04-29 00:44:25,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:25,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454923124] [2021-04-29 00:44:25,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:25,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:44:25,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130914616] [2021-04-29 00:44:25,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:44:25,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:25,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:44:25,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:44:25,325 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 325 [2021-04-29 00:44:25,326 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 504 flow. Second operand has 5 states, 5 states have (on average 172.6) internal successors, (863), 5 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-04-29 00:44:25,326 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:25,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 325 [2021-04-29 00:44:25,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:25,731 INFO L129 PetriNetUnfolder]: 236/664 cut-off events. [2021-04-29 00:44:25,731 INFO L130 PetriNetUnfolder]: For 1908/1955 co-relation queries the response was YES. [2021-04-29 00:44:25,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 664 events. 236/664 cut-off events. For 1908/1955 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4774 event pairs, 49 based on Foata normal form. 12/523 useless extension candidates. Maximal degree in co-relation 2479. Up to 318 conditions per place. [2021-04-29 00:44:25,742 INFO L132 encePairwiseOnDemand]: 315/325 looper letters, 35 selfloop transitions, 26 changer transitions 0/92 dead transitions. [2021-04-29 00:44:25,742 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 92 transitions, 769 flow [2021-04-29 00:44:25,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:44:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:44:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 882 transitions. [2021-04-29 00:44:25,748 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5427692307692308 [2021-04-29 00:44:25,748 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 882 transitions. [2021-04-29 00:44:25,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 882 transitions. [2021-04-29 00:44:25,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:25,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 882 transitions. [2021-04-29 00:44:25,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.4) internal successors, (882), 5 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:25,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:25,755 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:25,756 INFO L185 Difference]: Start difference. First operand has 74 places, 76 transitions, 504 flow. Second operand 5 states and 882 transitions. [2021-04-29 00:44:25,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 92 transitions, 769 flow [2021-04-29 00:44:25,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 92 transitions, 732 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-04-29 00:44:25,767 INFO L241 Difference]: Finished difference. Result has 76 places, 90 transitions, 697 flow [2021-04-29 00:44:25,768 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=697, PETRI_PLACES=76, PETRI_TRANSITIONS=90} [2021-04-29 00:44:25,768 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -50 predicate places. [2021-04-29 00:44:25,768 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:25,768 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 90 transitions, 697 flow [2021-04-29 00:44:25,769 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 90 transitions, 697 flow [2021-04-29 00:44:25,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 90 transitions, 697 flow [2021-04-29 00:44:25,953 INFO L129 PetriNetUnfolder]: 189/551 cut-off events. [2021-04-29 00:44:25,954 INFO L130 PetriNetUnfolder]: For 1792/1846 co-relation queries the response was YES. [2021-04-29 00:44:25,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2105 conditions, 551 events. 189/551 cut-off events. For 1792/1846 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3874 event pairs, 26 based on Foata normal form. 9/416 useless extension candidates. Maximal degree in co-relation 2081. Up to 183 conditions per place. [2021-04-29 00:44:25,971 INFO L146 LiptonReduction]: Number of co-enabled transitions 2352 [2021-04-29 00:44:25,980 INFO L158 LiptonReduction]: Checked pairs total: 201 [2021-04-29 00:44:25,980 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:25,980 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 212 [2021-04-29 00:44:25,981 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 90 transitions, 697 flow [2021-04-29 00:44:25,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 172.6) internal successors, (863), 5 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-04-29 00:44:25,982 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:25,982 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:25,983 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-29 00:44:25,983 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-04-29 00:44:25,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:25,983 INFO L82 PathProgramCache]: Analyzing trace with hash 776067847, now seen corresponding path program 2 times [2021-04-29 00:44:25,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:25,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474012828] [2021-04-29 00:44:25,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:26,088 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-04-29 00:44:26,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-04-29 00:44:26,145 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-04-29 00:44:26,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-04-29 00:44:26,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:26,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-04-29 00:44:26,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:26,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-29 00:44:26,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:26,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:44:26,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:26,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-04-29 00:44:26,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:26,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474012828] [2021-04-29 00:44:26,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:26,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:44:26,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111327165] [2021-04-29 00:44:26,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:44:26,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:26,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:44:26,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:44:26,333 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 325 [2021-04-29 00:44:26,335 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 90 transitions, 697 flow. Second operand has 8 states, 8 states have (on average 156.0) internal successors, (1248), 8 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:26,335 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:26,336 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 325 [2021-04-29 00:44:26,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:27,332 INFO L129 PetriNetUnfolder]: 289/859 cut-off events. [2021-04-29 00:44:27,332 INFO L130 PetriNetUnfolder]: For 2937/2982 co-relation queries the response was YES. [2021-04-29 00:44:27,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3529 conditions, 859 events. 289/859 cut-off events. For 2937/2982 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6708 event pairs, 8 based on Foata normal form. 32/673 useless extension candidates. Maximal degree in co-relation 3503. Up to 272 conditions per place. [2021-04-29 00:44:27,347 INFO L132 encePairwiseOnDemand]: 315/325 looper letters, 55 selfloop transitions, 54 changer transitions 15/155 dead transitions. [2021-04-29 00:44:27,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 155 transitions, 1570 flow [2021-04-29 00:44:27,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-29 00:44:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-04-29 00:44:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1602 transitions. [2021-04-29 00:44:27,356 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4929230769230769 [2021-04-29 00:44:27,356 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1602 transitions. [2021-04-29 00:44:27,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1602 transitions. [2021-04-29 00:44:27,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:27,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1602 transitions. [2021-04-29 00:44:27,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 160.2) internal successors, (1602), 10 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:27,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 325.0) internal successors, (3575), 11 states have internal predecessors, (3575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:27,374 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 325.0) internal successors, (3575), 11 states have internal predecessors, (3575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:27,374 INFO L185 Difference]: Start difference. First operand has 76 places, 90 transitions, 697 flow. Second operand 10 states and 1602 transitions. [2021-04-29 00:44:27,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 155 transitions, 1570 flow [2021-04-29 00:44:27,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 155 transitions, 1473 flow, removed 48 selfloop flow, removed 1 redundant places. [2021-04-29 00:44:27,399 INFO L241 Difference]: Finished difference. Result has 90 places, 125 transitions, 1231 flow [2021-04-29 00:44:27,399 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1231, PETRI_PLACES=90, PETRI_TRANSITIONS=125} [2021-04-29 00:44:27,400 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -36 predicate places. [2021-04-29 00:44:27,400 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:27,400 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 125 transitions, 1231 flow [2021-04-29 00:44:27,400 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 125 transitions, 1231 flow [2021-04-29 00:44:27,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 125 transitions, 1231 flow [2021-04-29 00:44:27,585 INFO L129 PetriNetUnfolder]: 244/666 cut-off events. [2021-04-29 00:44:27,585 INFO L130 PetriNetUnfolder]: For 3432/3482 co-relation queries the response was YES. [2021-04-29 00:44:27,592 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3074 conditions, 666 events. 244/666 cut-off events. For 3432/3482 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4800 event pairs, 20 based on Foata normal form. 19/537 useless extension candidates. Maximal degree in co-relation 3043. Up to 208 conditions per place. [2021-04-29 00:44:27,609 INFO L146 LiptonReduction]: Number of co-enabled transitions 2834 [2021-04-29 00:44:27,623 INFO L158 LiptonReduction]: Checked pairs total: 616 [2021-04-29 00:44:27,623 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:27,623 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 223 [2021-04-29 00:44:27,625 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 125 transitions, 1231 flow [2021-04-29 00:44:27,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 156.0) internal successors, (1248), 8 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:27,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:27,626 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:27,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-29 00:44:27,626 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-04-29 00:44:27,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:27,627 INFO L82 PathProgramCache]: Analyzing trace with hash 734663278, now seen corresponding path program 1 times [2021-04-29 00:44:27,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:27,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685536231] [2021-04-29 00:44:27,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:27,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:27,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:44:27,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:27,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:44:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:27,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685536231] [2021-04-29 00:44:27,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:27,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-29 00:44:27,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024269007] [2021-04-29 00:44:27,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:44:27,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:27,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:44:27,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:44:27,716 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 325 [2021-04-29 00:44:27,717 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 125 transitions, 1231 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:27,717 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:27,717 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 325 [2021-04-29 00:44:27,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:28,045 INFO L129 PetriNetUnfolder]: 305/944 cut-off events. [2021-04-29 00:44:28,046 INFO L130 PetriNetUnfolder]: For 5230/5346 co-relation queries the response was YES. [2021-04-29 00:44:28,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4133 conditions, 944 events. 305/944 cut-off events. For 5230/5346 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 7699 event pairs, 44 based on Foata normal form. 41/743 useless extension candidates. Maximal degree in co-relation 4100. Up to 274 conditions per place. [2021-04-29 00:44:28,062 INFO L132 encePairwiseOnDemand]: 322/325 looper letters, 4 selfloop transitions, 3 changer transitions 5/125 dead transitions. [2021-04-29 00:44:28,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 125 transitions, 1245 flow [2021-04-29 00:44:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:44:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:44:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 789 transitions. [2021-04-29 00:44:28,067 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8092307692307692 [2021-04-29 00:44:28,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 789 transitions. [2021-04-29 00:44:28,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 789 transitions. [2021-04-29 00:44:28,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:28,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 789 transitions. [2021-04-29 00:44:28,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:28,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:28,073 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:28,073 INFO L185 Difference]: Start difference. First operand has 90 places, 125 transitions, 1231 flow. Second operand 3 states and 789 transitions. [2021-04-29 00:44:28,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 125 transitions, 1245 flow [2021-04-29 00:44:28,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 125 transitions, 1162 flow, removed 33 selfloop flow, removed 1 redundant places. [2021-04-29 00:44:28,112 INFO L241 Difference]: Finished difference. Result has 92 places, 120 transitions, 1107 flow [2021-04-29 00:44:28,113 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1107, PETRI_PLACES=92, PETRI_TRANSITIONS=120} [2021-04-29 00:44:28,113 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -34 predicate places. [2021-04-29 00:44:28,113 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:28,113 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 120 transitions, 1107 flow [2021-04-29 00:44:28,114 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 120 transitions, 1107 flow [2021-04-29 00:44:28,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 92 places, 120 transitions, 1107 flow [2021-04-29 00:44:28,353 INFO L129 PetriNetUnfolder]: 293/889 cut-off events. [2021-04-29 00:44:28,353 INFO L130 PetriNetUnfolder]: For 3985/4051 co-relation queries the response was YES. [2021-04-29 00:44:28,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3803 conditions, 889 events. 293/889 cut-off events. For 3985/4051 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 7253 event pairs, 23 based on Foata normal form. 28/697 useless extension candidates. Maximal degree in co-relation 3771. Up to 265 conditions per place. [2021-04-29 00:44:28,377 INFO L146 LiptonReduction]: Number of co-enabled transitions 2730 [2021-04-29 00:44:28,388 INFO L158 LiptonReduction]: Checked pairs total: 592 [2021-04-29 00:44:28,389 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:28,389 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 276 [2021-04-29 00:44:28,390 INFO L480 AbstractCegarLoop]: Abstraction has has 92 places, 120 transitions, 1107 flow [2021-04-29 00:44:28,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:28,391 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:28,391 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:28,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-29 00:44:28,391 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-04-29 00:44:28,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:28,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1784569327, now seen corresponding path program 3 times [2021-04-29 00:44:28,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:28,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620401501] [2021-04-29 00:44:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:28,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:28,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:44:28,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:28,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:44:28,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:28,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:44:28,624 INFO L142 QuantifierPusher]: treesize reduction 21, result has 70.0 percent of original size [2021-04-29 00:44:28,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-04-29 00:44:28,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:28,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:44:28,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:28,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:44:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:28,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620401501] [2021-04-29 00:44:28,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:28,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:44:28,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485303542] [2021-04-29 00:44:28,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:44:28,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:28,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:44:28,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:44:28,754 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 325 [2021-04-29 00:44:28,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 120 transitions, 1107 flow. Second operand has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:28,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:28,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 325 [2021-04-29 00:44:28,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:29,681 INFO L129 PetriNetUnfolder]: 422/1306 cut-off events. [2021-04-29 00:44:29,682 INFO L130 PetriNetUnfolder]: For 6822/7043 co-relation queries the response was YES. [2021-04-29 00:44:29,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6183 conditions, 1306 events. 422/1306 cut-off events. For 6822/7043 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 11611 event pairs, 35 based on Foata normal form. 98/1054 useless extension candidates. Maximal degree in co-relation 6149. Up to 585 conditions per place. [2021-04-29 00:44:29,704 INFO L132 encePairwiseOnDemand]: 317/325 looper letters, 82 selfloop transitions, 30 changer transitions 25/168 dead transitions. [2021-04-29 00:44:29,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 168 transitions, 1954 flow [2021-04-29 00:44:29,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:44:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:44:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1224 transitions. [2021-04-29 00:44:29,712 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.538021978021978 [2021-04-29 00:44:29,712 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1224 transitions. [2021-04-29 00:44:29,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1224 transitions. [2021-04-29 00:44:29,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:29,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1224 transitions. [2021-04-29 00:44:29,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:29,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 325.0) internal successors, (2600), 8 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:29,723 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 325.0) internal successors, (2600), 8 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:29,723 INFO L185 Difference]: Start difference. First operand has 92 places, 120 transitions, 1107 flow. Second operand 7 states and 1224 transitions. [2021-04-29 00:44:29,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 168 transitions, 1954 flow [2021-04-29 00:44:29,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 168 transitions, 1939 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-04-29 00:44:29,765 INFO L241 Difference]: Finished difference. Result has 101 places, 140 transitions, 1482 flow [2021-04-29 00:44:29,765 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1482, PETRI_PLACES=101, PETRI_TRANSITIONS=140} [2021-04-29 00:44:29,765 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -25 predicate places. [2021-04-29 00:44:29,765 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:29,766 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 140 transitions, 1482 flow [2021-04-29 00:44:29,766 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 140 transitions, 1482 flow [2021-04-29 00:44:29,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 140 transitions, 1482 flow [2021-04-29 00:44:30,046 INFO L129 PetriNetUnfolder]: 345/1039 cut-off events. [2021-04-29 00:44:30,046 INFO L130 PetriNetUnfolder]: For 6202/6330 co-relation queries the response was YES. [2021-04-29 00:44:30,056 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4903 conditions, 1039 events. 345/1039 cut-off events. For 6202/6330 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 8782 event pairs, 19 based on Foata normal form. 54/824 useless extension candidates. Maximal degree in co-relation 4866. Up to 324 conditions per place. [2021-04-29 00:44:30,083 INFO L146 LiptonReduction]: Number of co-enabled transitions 3138 [2021-04-29 00:44:30,098 INFO L158 LiptonReduction]: Checked pairs total: 1008 [2021-04-29 00:44:30,098 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:30,098 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 333 [2021-04-29 00:44:30,100 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 140 transitions, 1482 flow [2021-04-29 00:44:30,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:30,109 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:30,109 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:30,109 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-29 00:44:30,110 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-04-29 00:44:30,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:30,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1794870767, now seen corresponding path program 1 times [2021-04-29 00:44:30,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:30,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378603076] [2021-04-29 00:44:30,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:30,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:30,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:44:30,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:30,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:44:30,388 INFO L142 QuantifierPusher]: treesize reduction 10, result has 75.0 percent of original size [2021-04-29 00:44:30,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-04-29 00:44:30,464 INFO L142 QuantifierPusher]: treesize reduction 20, result has 72.2 percent of original size [2021-04-29 00:44:30,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-04-29 00:44:30,617 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2021-04-29 00:44:30,623 INFO L142 QuantifierPusher]: treesize reduction 21, result has 80.6 percent of original size [2021-04-29 00:44:30,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 87 [2021-04-29 00:44:30,769 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2021-04-29 00:44:30,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:30,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-04-29 00:44:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:30,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378603076] [2021-04-29 00:44:30,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:30,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:44:30,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190319663] [2021-04-29 00:44:30,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-29 00:44:30,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:30,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-29 00:44:30,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-04-29 00:44:30,839 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 325 [2021-04-29 00:44:30,857 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 140 transitions, 1482 flow. Second operand has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:30,857 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:30,857 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 325 [2021-04-29 00:44:30,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:30,980 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2021-04-29 00:44:31,162 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2021-04-29 00:44:31,833 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2021-04-29 00:44:32,353 INFO L129 PetriNetUnfolder]: 431/1338 cut-off events. [2021-04-29 00:44:32,353 INFO L130 PetriNetUnfolder]: For 10791/11122 co-relation queries the response was YES. [2021-04-29 00:44:32,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7171 conditions, 1338 events. 431/1338 cut-off events. For 10791/11122 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 11849 event pairs, 5 based on Foata normal form. 84/1086 useless extension candidates. Maximal degree in co-relation 7132. Up to 415 conditions per place. [2021-04-29 00:44:32,378 INFO L132 encePairwiseOnDemand]: 317/325 looper letters, 84 selfloop transitions, 72 changer transitions 34/221 dead transitions. [2021-04-29 00:44:32,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 221 transitions, 2951 flow [2021-04-29 00:44:32,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-29 00:44:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-29 00:44:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1485 transitions. [2021-04-29 00:44:32,386 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2021-04-29 00:44:32,387 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1485 transitions. [2021-04-29 00:44:32,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1485 transitions. [2021-04-29 00:44:32,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:32,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1485 transitions. [2021-04-29 00:44:32,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 165.0) internal successors, (1485), 9 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:32,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:32,399 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:32,399 INFO L185 Difference]: Start difference. First operand has 99 places, 140 transitions, 1482 flow. Second operand 9 states and 1485 transitions. [2021-04-29 00:44:32,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 221 transitions, 2951 flow [2021-04-29 00:44:32,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 221 transitions, 2818 flow, removed 66 selfloop flow, removed 2 redundant places. [2021-04-29 00:44:32,457 INFO L241 Difference]: Finished difference. Result has 111 places, 162 transitions, 2033 flow [2021-04-29 00:44:32,457 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2033, PETRI_PLACES=111, PETRI_TRANSITIONS=162} [2021-04-29 00:44:32,457 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -15 predicate places. [2021-04-29 00:44:32,458 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:32,458 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 162 transitions, 2033 flow [2021-04-29 00:44:32,458 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 162 transitions, 2033 flow [2021-04-29 00:44:32,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 162 transitions, 2033 flow [2021-04-29 00:44:32,813 INFO L129 PetriNetUnfolder]: 370/1178 cut-off events. [2021-04-29 00:44:32,814 INFO L130 PetriNetUnfolder]: For 11087/11266 co-relation queries the response was YES. [2021-04-29 00:44:32,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6197 conditions, 1178 events. 370/1178 cut-off events. For 11087/11266 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 10441 event pairs, 5 based on Foata normal form. 68/923 useless extension candidates. Maximal degree in co-relation 6154. Up to 351 conditions per place. [2021-04-29 00:44:32,854 INFO L146 LiptonReduction]: Number of co-enabled transitions 3470 [2021-04-29 00:44:32,871 INFO L158 LiptonReduction]: Checked pairs total: 1632 [2021-04-29 00:44:32,872 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:32,872 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 414 [2021-04-29 00:44:32,873 INFO L480 AbstractCegarLoop]: Abstraction has has 111 places, 162 transitions, 2033 flow [2021-04-29 00:44:32,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:32,874 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:32,874 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:32,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-29 00:44:32,874 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-04-29 00:44:32,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash -864452783, now seen corresponding path program 1 times [2021-04-29 00:44:32,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:32,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540517434] [2021-04-29 00:44:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:32,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:32,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:44:33,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:33,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-29 00:44:33,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:33,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-04-29 00:44:33,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:33,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-29 00:44:33,127 INFO L142 QuantifierPusher]: treesize reduction 3, result has 83.3 percent of original size [2021-04-29 00:44:33,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:44:33,160 INFO L142 QuantifierPusher]: treesize reduction 3, result has 72.7 percent of original size [2021-04-29 00:44:33,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-04-29 00:44:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:33,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540517434] [2021-04-29 00:44:33,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:33,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:44:33,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100016889] [2021-04-29 00:44:33,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:44:33,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:33,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:44:33,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:44:33,191 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 325 [2021-04-29 00:44:33,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 162 transitions, 2033 flow. Second operand has 8 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:33,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:33,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 325 [2021-04-29 00:44:33,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:34,634 INFO L129 PetriNetUnfolder]: 408/1416 cut-off events. [2021-04-29 00:44:34,634 INFO L130 PetriNetUnfolder]: For 13886/14147 co-relation queries the response was YES. [2021-04-29 00:44:34,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7948 conditions, 1416 events. 408/1416 cut-off events. For 13886/14147 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 13441 event pairs, 2 based on Foata normal form. 122/1140 useless extension candidates. Maximal degree in co-relation 7903. Up to 407 conditions per place. [2021-04-29 00:44:34,661 INFO L132 encePairwiseOnDemand]: 315/325 looper letters, 93 selfloop transitions, 124 changer transitions 9/257 dead transitions. [2021-04-29 00:44:34,661 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 257 transitions, 3846 flow [2021-04-29 00:44:34,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-29 00:44:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-04-29 00:44:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2010 transitions. [2021-04-29 00:44:34,670 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4757396449704142 [2021-04-29 00:44:34,671 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2010 transitions. [2021-04-29 00:44:34,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2010 transitions. [2021-04-29 00:44:34,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:34,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2010 transitions. [2021-04-29 00:44:34,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 154.6153846153846) internal successors, (2010), 13 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:34,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 325.0) internal successors, (4550), 14 states have internal predecessors, (4550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:34,687 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 325.0) internal successors, (4550), 14 states have internal predecessors, (4550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:34,687 INFO L185 Difference]: Start difference. First operand has 111 places, 162 transitions, 2033 flow. Second operand 13 states and 2010 transitions. [2021-04-29 00:44:34,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 257 transitions, 3846 flow [2021-04-29 00:44:34,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 257 transitions, 3646 flow, removed 78 selfloop flow, removed 3 redundant places. [2021-04-29 00:44:34,755 INFO L241 Difference]: Finished difference. Result has 125 places, 230 transitions, 3385 flow [2021-04-29 00:44:34,756 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3385, PETRI_PLACES=125, PETRI_TRANSITIONS=230} [2021-04-29 00:44:34,756 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -1 predicate places. [2021-04-29 00:44:34,756 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:34,756 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 230 transitions, 3385 flow [2021-04-29 00:44:34,757 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 230 transitions, 3385 flow [2021-04-29 00:44:34,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 230 transitions, 3385 flow [2021-04-29 00:44:35,040 INFO L129 PetriNetUnfolder]: 382/1268 cut-off events. [2021-04-29 00:44:35,040 INFO L130 PetriNetUnfolder]: For 12602/12752 co-relation queries the response was YES. [2021-04-29 00:44:35,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7119 conditions, 1268 events. 382/1268 cut-off events. For 12602/12752 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 11695 event pairs, 2 based on Foata normal form. 60/993 useless extension candidates. Maximal degree in co-relation 7071. Up to 356 conditions per place. [2021-04-29 00:44:35,079 INFO L146 LiptonReduction]: Number of co-enabled transitions 4094 [2021-04-29 00:44:35,109 INFO L158 LiptonReduction]: Checked pairs total: 2688 [2021-04-29 00:44:35,109 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:35,109 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 353 [2021-04-29 00:44:35,111 INFO L480 AbstractCegarLoop]: Abstraction has has 125 places, 230 transitions, 3385 flow [2021-04-29 00:44:35,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:35,112 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:35,112 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:35,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-29 00:44:35,112 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-04-29 00:44:35,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:35,113 INFO L82 PathProgramCache]: Analyzing trace with hash 816825993, now seen corresponding path program 2 times [2021-04-29 00:44:35,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:35,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753665948] [2021-04-29 00:44:35,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:35,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:35,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:44:35,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:35,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:44:35,282 INFO L142 QuantifierPusher]: treesize reduction 15, result has 60.5 percent of original size [2021-04-29 00:44:35,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-29 00:44:35,337 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size [2021-04-29 00:44:35,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-04-29 00:44:35,414 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.8 percent of original size [2021-04-29 00:44:35,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-04-29 00:44:35,500 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.8 percent of original size [2021-04-29 00:44:35,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-04-29 00:44:35,505 INFO L142 QuantifierPusher]: treesize reduction 11, result has 66.7 percent of original size [2021-04-29 00:44:35,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-04-29 00:44:35,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:35,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753665948] [2021-04-29 00:44:35,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:35,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:44:35,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624090521] [2021-04-29 00:44:35,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:44:35,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:35,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:44:35,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:44:35,560 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 325 [2021-04-29 00:44:35,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 230 transitions, 3385 flow. Second operand has 8 states, 8 states have (on average 158.0) internal successors, (1264), 8 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:35,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:35,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 325 [2021-04-29 00:44:35,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:36,818 INFO L129 PetriNetUnfolder]: 379/1267 cut-off events. [2021-04-29 00:44:36,818 INFO L130 PetriNetUnfolder]: For 13632/13994 co-relation queries the response was YES. [2021-04-29 00:44:36,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7748 conditions, 1267 events. 379/1267 cut-off events. For 13632/13994 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 11613 event pairs, 0 based on Foata normal form. 147/1075 useless extension candidates. Maximal degree in co-relation 7698. Up to 605 conditions per place. [2021-04-29 00:44:36,833 INFO L132 encePairwiseOnDemand]: 316/325 looper letters, 118 selfloop transitions, 62 changer transitions 40/251 dead transitions. [2021-04-29 00:44:36,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 251 transitions, 4148 flow [2021-04-29 00:44:36,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-29 00:44:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-29 00:44:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1455 transitions. [2021-04-29 00:44:36,841 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.49743589743589745 [2021-04-29 00:44:36,842 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1455 transitions. [2021-04-29 00:44:36,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1455 transitions. [2021-04-29 00:44:36,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:36,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1455 transitions. [2021-04-29 00:44:36,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 161.66666666666666) internal successors, (1455), 9 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:36,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:36,854 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:36,854 INFO L185 Difference]: Start difference. First operand has 125 places, 230 transitions, 3385 flow. Second operand 9 states and 1455 transitions. [2021-04-29 00:44:36,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 251 transitions, 4148 flow [2021-04-29 00:44:36,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 251 transitions, 3977 flow, removed 73 selfloop flow, removed 2 redundant places. [2021-04-29 00:44:36,948 INFO L241 Difference]: Finished difference. Result has 132 places, 205 transitions, 3060 flow [2021-04-29 00:44:36,948 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=3270, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3060, PETRI_PLACES=132, PETRI_TRANSITIONS=205} [2021-04-29 00:44:36,948 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, 6 predicate places. [2021-04-29 00:44:36,948 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:36,949 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 205 transitions, 3060 flow [2021-04-29 00:44:36,949 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 205 transitions, 3060 flow [2021-04-29 00:44:36,951 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 205 transitions, 3060 flow [2021-04-29 00:44:37,172 INFO L129 PetriNetUnfolder]: 347/1073 cut-off events. [2021-04-29 00:44:37,172 INFO L130 PetriNetUnfolder]: For 11196/11330 co-relation queries the response was YES. [2021-04-29 00:44:37,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6263 conditions, 1073 events. 347/1073 cut-off events. For 11196/11330 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 9244 event pairs, 6 based on Foata normal form. 72/867 useless extension candidates. Maximal degree in co-relation 6215. Up to 320 conditions per place. [2021-04-29 00:44:37,207 INFO L146 LiptonReduction]: Number of co-enabled transitions 3574 [2021-04-29 00:44:37,232 INFO L158 LiptonReduction]: Checked pairs total: 2430 [2021-04-29 00:44:37,232 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:37,233 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 285 [2021-04-29 00:44:37,234 INFO L480 AbstractCegarLoop]: Abstraction has has 128 places, 205 transitions, 3060 flow [2021-04-29 00:44:37,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 158.0) internal successors, (1264), 8 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:37,235 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:37,235 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:37,235 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-04-29 00:44:37,235 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-04-29 00:44:37,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:37,236 INFO L82 PathProgramCache]: Analyzing trace with hash 378513575, now seen corresponding path program 2 times [2021-04-29 00:44:37,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:37,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908916527] [2021-04-29 00:44:37,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:37,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:37,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:44:37,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:37,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:44:37,438 INFO L142 QuantifierPusher]: treesize reduction 26, result has 60.6 percent of original size [2021-04-29 00:44:37,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-04-29 00:44:37,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:37,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:44:37,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:37,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:44:37,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:37,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:44:37,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:37,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:44:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:37,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908916527] [2021-04-29 00:44:37,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:37,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-29 00:44:37,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577715379] [2021-04-29 00:44:37,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-29 00:44:37,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:37,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-29 00:44:37,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-04-29 00:44:37,668 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 325 [2021-04-29 00:44:37,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 205 transitions, 3060 flow. Second operand has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:37,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:37,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 325 [2021-04-29 00:44:37,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:38,742 INFO L129 PetriNetUnfolder]: 424/1406 cut-off events. [2021-04-29 00:44:38,742 INFO L130 PetriNetUnfolder]: For 16096/16362 co-relation queries the response was YES. [2021-04-29 00:44:38,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8839 conditions, 1406 events. 424/1406 cut-off events. For 16096/16362 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 13258 event pairs, 3 based on Foata normal form. 112/1121 useless extension candidates. Maximal degree in co-relation 8789. Up to 560 conditions per place. [2021-04-29 00:44:38,767 INFO L132 encePairwiseOnDemand]: 318/325 looper letters, 131 selfloop transitions, 69 changer transitions 41/272 dead transitions. [2021-04-29 00:44:38,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 272 transitions, 4720 flow [2021-04-29 00:44:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:44:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:44:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1141 transitions. [2021-04-29 00:44:38,776 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5015384615384615 [2021-04-29 00:44:38,776 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1141 transitions. [2021-04-29 00:44:38,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1141 transitions. [2021-04-29 00:44:38,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:38,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1141 transitions. [2021-04-29 00:44:38,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:38,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 325.0) internal successors, (2600), 8 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:38,786 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 325.0) internal successors, (2600), 8 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:38,786 INFO L185 Difference]: Start difference. First operand has 128 places, 205 transitions, 3060 flow. Second operand 7 states and 1141 transitions. [2021-04-29 00:44:38,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 272 transitions, 4720 flow [2021-04-29 00:44:38,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 272 transitions, 4412 flow, removed 60 selfloop flow, removed 13 redundant places. [2021-04-29 00:44:38,886 INFO L241 Difference]: Finished difference. Result has 125 places, 219 transitions, 3381 flow [2021-04-29 00:44:38,887 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=2827, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3381, PETRI_PLACES=125, PETRI_TRANSITIONS=219} [2021-04-29 00:44:38,887 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -1 predicate places. [2021-04-29 00:44:38,887 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:38,887 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 219 transitions, 3381 flow [2021-04-29 00:44:38,888 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 219 transitions, 3381 flow [2021-04-29 00:44:38,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 219 transitions, 3381 flow [2021-04-29 00:44:39,254 INFO L129 PetriNetUnfolder]: 362/1170 cut-off events. [2021-04-29 00:44:39,254 INFO L130 PetriNetUnfolder]: For 13394/13500 co-relation queries the response was YES. [2021-04-29 00:44:39,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7073 conditions, 1170 events. 362/1170 cut-off events. For 13394/13500 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 10512 event pairs, 6 based on Foata normal form. 62/919 useless extension candidates. Maximal degree in co-relation 7027. Up to 340 conditions per place. [2021-04-29 00:44:39,288 INFO L146 LiptonReduction]: Number of co-enabled transitions 3638 [2021-04-29 00:44:39,315 INFO L158 LiptonReduction]: Checked pairs total: 2494 [2021-04-29 00:44:39,315 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:39,315 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 428 [2021-04-29 00:44:39,317 INFO L480 AbstractCegarLoop]: Abstraction has has 123 places, 219 transitions, 3381 flow [2021-04-29 00:44:39,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:39,317 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:39,318 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:39,318 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-04-29 00:44:39,318 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-04-29 00:44:39,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:39,318 INFO L82 PathProgramCache]: Analyzing trace with hash -746475107, now seen corresponding path program 3 times [2021-04-29 00:44:39,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:39,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490746430] [2021-04-29 00:44:39,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:39,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:39,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:44:39,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:39,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:44:39,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:39,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:44:39,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:39,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:44:39,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:39,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-29 00:44:39,543 INFO L142 QuantifierPusher]: treesize reduction 38, result has 70.8 percent of original size [2021-04-29 00:44:39,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 92 [2021-04-29 00:44:39,688 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2021-04-29 00:44:39,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:39,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:44:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:39,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490746430] [2021-04-29 00:44:39,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:39,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:44:39,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539318674] [2021-04-29 00:44:39,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-29 00:44:39,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:39,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-29 00:44:39,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-04-29 00:44:39,734 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 325 [2021-04-29 00:44:39,735 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 219 transitions, 3381 flow. Second operand has 7 states, 7 states have (on average 164.28571428571428) internal successors, (1150), 7 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:39,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:39,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 325 [2021-04-29 00:44:39,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:40,365 INFO L129 PetriNetUnfolder]: 364/1252 cut-off events. [2021-04-29 00:44:40,365 INFO L130 PetriNetUnfolder]: For 16158/16395 co-relation queries the response was YES. [2021-04-29 00:44:40,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8188 conditions, 1252 events. 364/1252 cut-off events. For 16158/16395 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 11588 event pairs, 0 based on Foata normal form. 109/1018 useless extension candidates. Maximal degree in co-relation 8140. Up to 433 conditions per place. [2021-04-29 00:44:40,382 INFO L132 encePairwiseOnDemand]: 319/325 looper letters, 88 selfloop transitions, 88 changer transitions 26/233 dead transitions. [2021-04-29 00:44:40,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 233 transitions, 4039 flow [2021-04-29 00:44:40,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:44:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:44:40,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 839 transitions. [2021-04-29 00:44:40,389 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5163076923076924 [2021-04-29 00:44:40,389 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 839 transitions. [2021-04-29 00:44:40,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 839 transitions. [2021-04-29 00:44:40,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:40,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 839 transitions. [2021-04-29 00:44:40,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:40,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:40,396 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:40,396 INFO L185 Difference]: Start difference. First operand has 123 places, 219 transitions, 3381 flow. Second operand 5 states and 839 transitions. [2021-04-29 00:44:40,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 233 transitions, 4039 flow [2021-04-29 00:44:40,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 233 transitions, 3982 flow, removed 28 selfloop flow, removed 2 redundant places. [2021-04-29 00:44:40,507 INFO L241 Difference]: Finished difference. Result has 128 places, 202 transitions, 3386 flow [2021-04-29 00:44:40,507 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=3291, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3386, PETRI_PLACES=128, PETRI_TRANSITIONS=202} [2021-04-29 00:44:40,508 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, 2 predicate places. [2021-04-29 00:44:40,508 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:40,508 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 202 transitions, 3386 flow [2021-04-29 00:44:40,508 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 202 transitions, 3386 flow [2021-04-29 00:44:40,511 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 202 transitions, 3386 flow [2021-04-29 00:44:40,744 INFO L129 PetriNetUnfolder]: 280/1026 cut-off events. [2021-04-29 00:44:40,744 INFO L130 PetriNetUnfolder]: For 14704/14827 co-relation queries the response was YES. [2021-04-29 00:44:40,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6369 conditions, 1026 events. 280/1026 cut-off events. For 14704/14827 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 9335 event pairs, 8 based on Foata normal form. 65/793 useless extension candidates. Maximal degree in co-relation 6320. Up to 294 conditions per place. [2021-04-29 00:44:40,766 INFO L146 LiptonReduction]: Number of co-enabled transitions 3222 [2021-04-29 00:44:40,787 INFO L158 LiptonReduction]: Checked pairs total: 1850 [2021-04-29 00:44:40,788 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:40,788 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 280 [2021-04-29 00:44:40,790 INFO L480 AbstractCegarLoop]: Abstraction has has 128 places, 202 transitions, 3386 flow [2021-04-29 00:44:40,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 164.28571428571428) internal successors, (1150), 7 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:40,790 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:40,790 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:40,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-04-29 00:44:40,791 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-04-29 00:44:40,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:40,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1698430649, now seen corresponding path program 4 times [2021-04-29 00:44:40,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:40,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12957753] [2021-04-29 00:44:40,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:40,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:40,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-29 00:44:40,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:40,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-04-29 00:44:40,979 INFO L142 QuantifierPusher]: treesize reduction 168, result has 44.6 percent of original size [2021-04-29 00:44:40,982 INFO L147 QuantifierPusher]: treesize reduction 19, result has 85.9 percent of original size 116 [2021-04-29 00:44:41,162 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2021-04-29 00:44:41,174 INFO L142 QuantifierPusher]: treesize reduction 152, result has 36.4 percent of original size [2021-04-29 00:44:41,177 INFO L147 QuantifierPusher]: treesize reduction 9, result has 89.7 percent of original size 78 [2021-04-29 00:44:41,305 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2021-04-29 00:44:41,309 INFO L142 QuantifierPusher]: treesize reduction 18, result has 82.0 percent of original size [2021-04-29 00:44:41,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 82 [2021-04-29 00:44:41,445 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2021-04-29 00:44:41,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:41,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-29 00:44:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:41,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12957753] [2021-04-29 00:44:41,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:41,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:44:41,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299589779] [2021-04-29 00:44:41,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:44:41,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:41,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:44:41,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:44:41,481 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 325 [2021-04-29 00:44:41,482 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 202 transitions, 3386 flow. Second operand has 8 states, 8 states have (on average 154.125) internal successors, (1233), 8 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:41,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:41,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 325 [2021-04-29 00:44:41,483 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:41,718 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2021-04-29 00:44:41,891 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2021-04-29 00:44:42,072 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2021-04-29 00:44:42,413 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2021-04-29 00:44:42,816 INFO L129 PetriNetUnfolder]: 283/1123 cut-off events. [2021-04-29 00:44:42,816 INFO L130 PetriNetUnfolder]: For 17075/17311 co-relation queries the response was YES. [2021-04-29 00:44:42,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7318 conditions, 1123 events. 283/1123 cut-off events. For 17075/17311 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 10702 event pairs, 5 based on Foata normal form. 90/870 useless extension candidates. Maximal degree in co-relation 7267. Up to 311 conditions per place. [2021-04-29 00:44:42,827 INFO L132 encePairwiseOnDemand]: 319/325 looper letters, 116 selfloop transitions, 38 changer transitions 36/220 dead transitions. [2021-04-29 00:44:42,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 220 transitions, 4074 flow [2021-04-29 00:44:42,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-04-29 00:44:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-04-29 00:44:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1253 transitions. [2021-04-29 00:44:42,841 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4819230769230769 [2021-04-29 00:44:42,842 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1253 transitions. [2021-04-29 00:44:42,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1253 transitions. [2021-04-29 00:44:42,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:42,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1253 transitions. [2021-04-29 00:44:42,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 156.625) internal successors, (1253), 8 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:42,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 325.0) internal successors, (2925), 9 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:42,854 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 325.0) internal successors, (2925), 9 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:42,854 INFO L185 Difference]: Start difference. First operand has 128 places, 202 transitions, 3386 flow. Second operand 8 states and 1253 transitions. [2021-04-29 00:44:42,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 220 transitions, 4074 flow [2021-04-29 00:44:42,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 220 transitions, 3970 flow, removed 35 selfloop flow, removed 5 redundant places. [2021-04-29 00:44:42,934 INFO L241 Difference]: Finished difference. Result has 133 places, 176 transitions, 2890 flow [2021-04-29 00:44:42,934 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=3300, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2890, PETRI_PLACES=133, PETRI_TRANSITIONS=176} [2021-04-29 00:44:42,935 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, 7 predicate places. [2021-04-29 00:44:42,935 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:42,935 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 176 transitions, 2890 flow [2021-04-29 00:44:42,935 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 176 transitions, 2890 flow [2021-04-29 00:44:42,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 176 transitions, 2890 flow [2021-04-29 00:44:43,110 INFO L129 PetriNetUnfolder]: 201/889 cut-off events. [2021-04-29 00:44:43,111 INFO L130 PetriNetUnfolder]: For 11658/11715 co-relation queries the response was YES. [2021-04-29 00:44:43,115 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5144 conditions, 889 events. 201/889 cut-off events. For 11658/11715 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 8380 event pairs, 1 based on Foata normal form. 31/642 useless extension candidates. Maximal degree in co-relation 5095. Up to 229 conditions per place. [2021-04-29 00:44:43,127 INFO L146 LiptonReduction]: Number of co-enabled transitions 2694 [2021-04-29 00:44:43,143 INFO L158 LiptonReduction]: Checked pairs total: 1488 [2021-04-29 00:44:43,143 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:43,144 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 209 [2021-04-29 00:44:43,145 INFO L480 AbstractCegarLoop]: Abstraction has has 132 places, 176 transitions, 2890 flow [2021-04-29 00:44:43,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 154.125) internal successors, (1233), 8 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:43,145 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:43,146 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:43,146 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-04-29 00:44:43,146 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-04-29 00:44:43,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:43,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1418952340, now seen corresponding path program 1 times [2021-04-29 00:44:43,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:43,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268344386] [2021-04-29 00:44:43,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:43,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:43,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:44:43,247 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-29 00:44:43,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:44:43,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:43,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:44:43,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:43,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268344386] [2021-04-29 00:44:43,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:43,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:44:43,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176524713] [2021-04-29 00:44:43,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 00:44:43,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:43,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 00:44:43,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-29 00:44:43,273 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 325 [2021-04-29 00:44:43,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 176 transitions, 2890 flow. Second operand has 4 states, 4 states have (on average 237.75) internal successors, (951), 4 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:43,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:43,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 325 [2021-04-29 00:44:43,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:50,180 INFO L129 PetriNetUnfolder]: 25337/40312 cut-off events. [2021-04-29 00:44:50,180 INFO L130 PetriNetUnfolder]: For 139191/147236 co-relation queries the response was YES. [2021-04-29 00:44:50,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96055 conditions, 40312 events. 25337/40312 cut-off events. For 139191/147236 co-relation queries the response was YES. Maximal size of possible extension queue 8988. Compared 399416 event pairs, 11064 based on Foata normal form. 1480/12714 useless extension candidates. Maximal degree in co-relation 96004. Up to 25708 conditions per place. [2021-04-29 00:44:50,466 INFO L132 encePairwiseOnDemand]: 308/325 looper letters, 42 selfloop transitions, 27 changer transitions 0/148 dead transitions. [2021-04-29 00:44:50,467 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 148 transitions, 1876 flow [2021-04-29 00:44:50,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:44:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:44:50,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1239 transitions. [2021-04-29 00:44:50,474 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7624615384615384 [2021-04-29 00:44:50,474 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1239 transitions. [2021-04-29 00:44:50,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1239 transitions. [2021-04-29 00:44:50,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:50,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1239 transitions. [2021-04-29 00:44:50,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 247.8) internal successors, (1239), 5 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:50,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:50,482 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:50,482 INFO L185 Difference]: Start difference. First operand has 132 places, 176 transitions, 2890 flow. Second operand 5 states and 1239 transitions. [2021-04-29 00:44:50,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 148 transitions, 1876 flow [2021-04-29 00:44:50,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 148 transitions, 1759 flow, removed 14 selfloop flow, removed 10 redundant places. [2021-04-29 00:44:50,802 INFO L241 Difference]: Finished difference. Result has 126 places, 138 transitions, 1808 flow [2021-04-29 00:44:50,802 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1808, PETRI_PLACES=126, PETRI_TRANSITIONS=138} [2021-04-29 00:44:50,802 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, 0 predicate places. [2021-04-29 00:44:50,803 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:50,803 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 138 transitions, 1808 flow [2021-04-29 00:44:50,803 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 138 transitions, 1808 flow [2021-04-29 00:44:50,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 138 transitions, 1808 flow [2021-04-29 00:44:55,274 INFO L129 PetriNetUnfolder]: 21758/35176 cut-off events. [2021-04-29 00:44:55,275 INFO L130 PetriNetUnfolder]: For 84775/101182 co-relation queries the response was YES. [2021-04-29 00:44:55,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113285 conditions, 35176 events. 21758/35176 cut-off events. For 84775/101182 co-relation queries the response was YES. Maximal size of possible extension queue 7760. Compared 354380 event pairs, 10332 based on Foata normal form. 184/10651 useless extension candidates. Maximal degree in co-relation 113237. Up to 32318 conditions per place. [2021-04-29 00:44:56,007 INFO L146 LiptonReduction]: Number of co-enabled transitions 2642 [2021-04-29 00:44:56,017 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:44:56,018 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:56,018 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5216 [2021-04-29 00:44:56,019 INFO L480 AbstractCegarLoop]: Abstraction has has 126 places, 138 transitions, 1808 flow [2021-04-29 00:44:56,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 237.75) internal successors, (951), 4 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:56,020 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:56,020 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:56,020 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-04-29 00:44:56,020 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-04-29 00:44:56,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:56,020 INFO L82 PathProgramCache]: Analyzing trace with hash 252013056, now seen corresponding path program 1 times [2021-04-29 00:44:56,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:56,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395031076] [2021-04-29 00:44:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:56,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:56,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:44:56,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:56,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:44:56,127 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-29 00:44:56,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:44:56,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:56,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:44:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:56,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395031076] [2021-04-29 00:44:56,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:56,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:44:56,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255180013] [2021-04-29 00:44:56,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:44:56,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:56,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:44:56,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:44:56,152 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 325 [2021-04-29 00:44:56,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 138 transitions, 1808 flow. Second operand has 5 states, 5 states have (on average 237.8) internal successors, (1189), 5 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:56,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:56,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 325 [2021-04-29 00:44:56,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:45:03,255 INFO L129 PetriNetUnfolder]: 24956/43375 cut-off events. [2021-04-29 00:45:03,257 INFO L130 PetriNetUnfolder]: For 159427/310215 co-relation queries the response was YES. [2021-04-29 00:45:03,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 175335 conditions, 43375 events. 24956/43375 cut-off events. For 159427/310215 co-relation queries the response was YES. Maximal size of possible extension queue 12087. Compared 488161 event pairs, 2502 based on Foata normal form. 1697/15490 useless extension candidates. Maximal degree in co-relation 175285. Up to 39509 conditions per place. [2021-04-29 00:45:03,568 INFO L132 encePairwiseOnDemand]: 308/325 looper letters, 24 selfloop transitions, 52 changer transitions 9/151 dead transitions. [2021-04-29 00:45:03,568 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 151 transitions, 1787 flow [2021-04-29 00:45:03,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:45:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:45:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1737 transitions. [2021-04-29 00:45:03,575 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7635164835164835 [2021-04-29 00:45:03,575 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1737 transitions. [2021-04-29 00:45:03,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1737 transitions. [2021-04-29 00:45:03,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:45:03,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1737 transitions. [2021-04-29 00:45:03,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 248.14285714285714) internal successors, (1737), 7 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:03,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 325.0) internal successors, (2600), 8 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:03,586 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 325.0) internal successors, (2600), 8 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:03,586 INFO L185 Difference]: Start difference. First operand has 126 places, 138 transitions, 1808 flow. Second operand 7 states and 1737 transitions. [2021-04-29 00:45:03,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 151 transitions, 1787 flow [2021-04-29 00:45:03,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 151 transitions, 1686 flow, removed 17 selfloop flow, removed 7 redundant places. [2021-04-29 00:45:03,842 INFO L241 Difference]: Finished difference. Result has 127 places, 140 transitions, 1674 flow [2021-04-29 00:45:03,842 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1674, PETRI_PLACES=127, PETRI_TRANSITIONS=140} [2021-04-29 00:45:03,842 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, 1 predicate places. [2021-04-29 00:45:03,842 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:45:03,843 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 140 transitions, 1674 flow [2021-04-29 00:45:03,843 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 140 transitions, 1674 flow [2021-04-29 00:45:03,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 140 transitions, 1674 flow [2021-04-29 00:45:07,378 INFO L129 PetriNetUnfolder]: 14334/28026 cut-off events. [2021-04-29 00:45:07,379 INFO L130 PetriNetUnfolder]: For 117748/196007 co-relation queries the response was YES. [2021-04-29 00:45:07,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126905 conditions, 28026 events. 14334/28026 cut-off events. For 117748/196007 co-relation queries the response was YES. Maximal size of possible extension queue 7171. Compared 339360 event pairs, 2511 based on Foata normal form. 76/8310 useless extension candidates. Maximal degree in co-relation 126857. Up to 25010 conditions per place. [2021-04-29 00:45:08,094 INFO L146 LiptonReduction]: Number of co-enabled transitions 2774 [2021-04-29 00:45:08,111 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:45:08,112 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:45:08,112 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4270 [2021-04-29 00:45:08,114 INFO L480 AbstractCegarLoop]: Abstraction has has 127 places, 140 transitions, 1674 flow [2021-04-29 00:45:08,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 237.8) internal successors, (1189), 5 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:08,114 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:45:08,114 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-04-29 00:45:08,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-04-29 00:45:08,115 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-04-29 00:45:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:45:08,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1203775547, now seen corresponding path program 1 times [2021-04-29 00:45:08,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:45:08,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144324493] [2021-04-29 00:45:08,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:45:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:45:08,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:45:08,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:45:08,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:45:08,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:45:08,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:45:08,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:45:08,266 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-29 00:45:08,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:45:08,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:45:08,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:45:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:45:08,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144324493] [2021-04-29 00:45:08,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:45:08,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:45:08,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119663586] [2021-04-29 00:45:08,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:45:08,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:45:08,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:45:08,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:45:08,297 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 325 [2021-04-29 00:45:08,299 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 140 transitions, 1674 flow. Second operand has 6 states, 6 states have (on average 237.83333333333334) internal successors, (1427), 6 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:08,299 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:45:08,299 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 325 [2021-04-29 00:45:08,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:45:13,696 INFO L129 PetriNetUnfolder]: 12365/27859 cut-off events. [2021-04-29 00:45:13,697 INFO L130 PetriNetUnfolder]: For 150061/387643 co-relation queries the response was YES. [2021-04-29 00:45:13,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146775 conditions, 27859 events. 12365/27859 cut-off events. For 150061/387643 co-relation queries the response was YES. Maximal size of possible extension queue 7167. Compared 380652 event pairs, 0 based on Foata normal form. 1336/9584 useless extension candidates. Maximal degree in co-relation 146725. Up to 24740 conditions per place. [2021-04-29 00:45:13,896 INFO L132 encePairwiseOnDemand]: 308/325 looper letters, 6 selfloop transitions, 67 changer transitions 30/151 dead transitions. [2021-04-29 00:45:13,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 151 transitions, 1827 flow [2021-04-29 00:45:13,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-29 00:45:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-29 00:45:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2217 transitions. [2021-04-29 00:45:13,904 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.757948717948718 [2021-04-29 00:45:13,904 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2217 transitions. [2021-04-29 00:45:13,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2217 transitions. [2021-04-29 00:45:13,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:45:13,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2217 transitions. [2021-04-29 00:45:13,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 246.33333333333334) internal successors, (2217), 9 states have internal predecessors, (2217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:13,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:13,916 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:13,916 INFO L185 Difference]: Start difference. First operand has 127 places, 140 transitions, 1674 flow. Second operand 9 states and 2217 transitions. [2021-04-29 00:45:13,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 151 transitions, 1827 flow [2021-04-29 00:45:23,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 151 transitions, 1579 flow, removed 68 selfloop flow, removed 9 redundant places. [2021-04-29 00:45:23,337 INFO L241 Difference]: Finished difference. Result has 128 places, 119 transitions, 1235 flow [2021-04-29 00:45:23,337 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1235, PETRI_PLACES=128, PETRI_TRANSITIONS=119} [2021-04-29 00:45:23,337 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, 2 predicate places. [2021-04-29 00:45:23,337 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:45:23,337 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 119 transitions, 1235 flow [2021-04-29 00:45:23,338 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 119 transitions, 1235 flow [2021-04-29 00:45:23,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 119 transitions, 1235 flow [2021-04-29 00:45:24,468 INFO L129 PetriNetUnfolder]: 4675/12119 cut-off events. [2021-04-29 00:45:24,468 INFO L130 PetriNetUnfolder]: For 35456/76830 co-relation queries the response was YES. [2021-04-29 00:45:24,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54918 conditions, 12119 events. 4675/12119 cut-off events. For 35456/76830 co-relation queries the response was YES. Maximal size of possible extension queue 4200. Compared 163620 event pairs, 0 based on Foata normal form. 16/3274 useless extension candidates. Maximal degree in co-relation 54872. Up to 8910 conditions per place. [2021-04-29 00:45:24,659 INFO L146 LiptonReduction]: Number of co-enabled transitions 2232 [2021-04-29 00:45:28,265 WARN L205 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-04-29 00:45:29,585 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 204 [2021-04-29 00:45:36,982 WARN L205 SmtUtils]: Spent 7.39 s on a formula simplification. DAG size of input: 378 DAG size of output: 316 [2021-04-29 00:45:40,371 WARN L205 SmtUtils]: Spent 3.38 s on a formula simplification that was a NOOP. DAG size: 307 [2021-04-29 00:45:40,391 INFO L158 LiptonReduction]: Checked pairs total: 14 [2021-04-29 00:45:40,391 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-29 00:45:40,391 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17054 [2021-04-29 00:45:40,392 INFO L480 AbstractCegarLoop]: Abstraction has has 125 places, 120 transitions, 1245 flow [2021-04-29 00:45:40,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 237.83333333333334) internal successors, (1427), 6 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:40,393 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:45:40,393 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-04-29 00:45:40,393 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-04-29 00:45:40,394 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-04-29 00:45:40,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:45:40,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1399245974, now seen corresponding path program 1 times [2021-04-29 00:45:40,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:45:40,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972719738] [2021-04-29 00:45:40,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:45:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:45:40,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:45:40,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:45:40,626 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.2 percent of original size [2021-04-29 00:45:40,629 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31 [2021-04-29 00:45:40,710 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-04-29 00:45:40,713 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-04-29 00:45:40,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:45:40,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:45:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:45:40,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972719738] [2021-04-29 00:45:40,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:45:40,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:45:40,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573883603] [2021-04-29 00:45:40,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:45:40,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:45:40,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:45:40,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:45:40,854 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 326 [2021-04-29 00:45:40,855 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 120 transitions, 1245 flow. Second operand has 6 states, 6 states have (on average 168.66666666666666) internal successors, (1012), 6 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:40,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:45:40,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 326 [2021-04-29 00:45:40,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:45:43,728 INFO L129 PetriNetUnfolder]: 6809/17532 cut-off events. [2021-04-29 00:45:43,728 INFO L130 PetriNetUnfolder]: For 58835/127551 co-relation queries the response was YES. [2021-04-29 00:45:43,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80029 conditions, 17532 events. 6809/17532 cut-off events. For 58835/127551 co-relation queries the response was YES. Maximal size of possible extension queue 6042. Compared 251315 event pairs, 0 based on Foata normal form. 51/4578 useless extension candidates. Maximal degree in co-relation 79981. Up to 13068 conditions per place. [2021-04-29 00:45:43,835 INFO L132 encePairwiseOnDemand]: 320/326 looper letters, 27 selfloop transitions, 8 changer transitions 12/126 dead transitions. [2021-04-29 00:45:43,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 126 transitions, 1440 flow [2021-04-29 00:45:43,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:45:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:45:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1023 transitions. [2021-04-29 00:45:43,841 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5230061349693251 [2021-04-29 00:45:43,841 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1023 transitions. [2021-04-29 00:45:43,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1023 transitions. [2021-04-29 00:45:43,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:45:43,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1023 transitions. [2021-04-29 00:45:43,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 170.5) internal successors, (1023), 6 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:43,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:43,847 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:43,847 INFO L185 Difference]: Start difference. First operand has 125 places, 120 transitions, 1245 flow. Second operand 6 states and 1023 transitions. [2021-04-29 00:45:43,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 126 transitions, 1440 flow [2021-04-29 00:46:01,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 126 transitions, 1163 flow, removed 57 selfloop flow, removed 16 redundant places. [2021-04-29 00:46:01,306 INFO L241 Difference]: Finished difference. Result has 115 places, 114 transitions, 934 flow [2021-04-29 00:46:01,306 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=934, PETRI_PLACES=115, PETRI_TRANSITIONS=114} [2021-04-29 00:46:01,306 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -11 predicate places. [2021-04-29 00:46:01,306 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:46:01,306 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 114 transitions, 934 flow [2021-04-29 00:46:01,307 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 114 transitions, 934 flow [2021-04-29 00:46:01,307 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 114 transitions, 934 flow [2021-04-29 00:46:02,253 INFO L129 PetriNetUnfolder]: 4665/12020 cut-off events. [2021-04-29 00:46:02,254 INFO L130 PetriNetUnfolder]: For 19625/20234 co-relation queries the response was YES. [2021-04-29 00:46:02,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46225 conditions, 12020 events. 4665/12020 cut-off events. For 19625/20234 co-relation queries the response was YES. Maximal size of possible extension queue 4239. Compared 164773 event pairs, 0 based on Foata normal form. 16/3395 useless extension candidates. Maximal degree in co-relation 46187. Up to 8910 conditions per place. [2021-04-29 00:46:02,452 INFO L146 LiptonReduction]: Number of co-enabled transitions 2020 [2021-04-29 00:46:02,457 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:46:02,457 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:46:02,457 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1151 [2021-04-29 00:46:02,458 INFO L480 AbstractCegarLoop]: Abstraction has has 112 places, 114 transitions, 934 flow [2021-04-29 00:46:02,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 168.66666666666666) internal successors, (1012), 6 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:46:02,459 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:46:02,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] [2021-04-29 00:46:02,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-04-29 00:46:02,459 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-04-29 00:46:02,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:46:02,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1414449431, now seen corresponding path program 1 times [2021-04-29 00:46:02,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:46:02,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953151145] [2021-04-29 00:46:02,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:46:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:46:02,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:46:02,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:46:02,549 INFO L142 QuantifierPusher]: treesize reduction 9, result has 62.5 percent of original size [2021-04-29 00:46:02,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:46:02,582 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-04-29 00:46:02,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-04-29 00:46:02,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:46:02,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:46:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:46:02,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953151145] [2021-04-29 00:46:02,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:46:02,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:46:02,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915035220] [2021-04-29 00:46:02,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:46:02,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:46:02,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:46:02,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:46:02,657 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 326 [2021-04-29 00:46:02,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 114 transitions, 934 flow. Second operand has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:46:02,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:46:02,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 326 [2021-04-29 00:46:02,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:46:04,376 INFO L129 PetriNetUnfolder]: 5593/14362 cut-off events. [2021-04-29 00:46:04,376 INFO L130 PetriNetUnfolder]: For 25811/26725 co-relation queries the response was YES. [2021-04-29 00:46:04,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55525 conditions, 14362 events. 5593/14362 cut-off events. For 25811/26725 co-relation queries the response was YES. Maximal size of possible extension queue 5217. Compared 198231 event pairs, 0 based on Foata normal form. 48/3823 useless extension candidates. Maximal degree in co-relation 55485. Up to 10692 conditions per place. [2021-04-29 00:46:04,490 INFO L132 encePairwiseOnDemand]: 319/326 looper letters, 25 selfloop transitions, 9 changer transitions 7/118 dead transitions. [2021-04-29 00:46:04,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 118 transitions, 1083 flow [2021-04-29 00:46:04,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:46:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:46:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1018 transitions. [2021-04-29 00:46:04,498 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5204498977505112 [2021-04-29 00:46:04,499 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1018 transitions. [2021-04-29 00:46:04,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1018 transitions. [2021-04-29 00:46:04,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:46:04,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1018 transitions. [2021-04-29 00:46:04,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 169.66666666666666) internal successors, (1018), 6 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:46:04,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:46:04,504 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:46:04,504 INFO L185 Difference]: Start difference. First operand has 112 places, 114 transitions, 934 flow. Second operand 6 states and 1018 transitions. [2021-04-29 00:46:04,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 118 transitions, 1083 flow [2021-04-29 00:46:11,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 118 transitions, 1033 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-04-29 00:46:11,854 INFO L241 Difference]: Finished difference. Result has 113 places, 111 transitions, 905 flow [2021-04-29 00:46:11,854 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=905, PETRI_PLACES=113, PETRI_TRANSITIONS=111} [2021-04-29 00:46:11,855 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -13 predicate places. [2021-04-29 00:46:11,855 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:46:11,855 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 111 transitions, 905 flow [2021-04-29 00:46:11,855 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 111 transitions, 905 flow [2021-04-29 00:46:11,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 111 transitions, 905 flow [2021-04-29 00:46:12,311 INFO L129 PetriNetUnfolder]: 2318/6046 cut-off events. [2021-04-29 00:46:12,312 INFO L130 PetriNetUnfolder]: For 9744/10093 co-relation queries the response was YES. [2021-04-29 00:46:12,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23252 conditions, 6046 events. 2318/6046 cut-off events. For 9744/10093 co-relation queries the response was YES. Maximal size of possible extension queue 2131. Compared 75117 event pairs, 0 based on Foata normal form. 8/1671 useless extension candidates. Maximal degree in co-relation 23215. Up to 4455 conditions per place. [2021-04-29 00:46:12,422 INFO L146 LiptonReduction]: Number of co-enabled transitions 1792 [2021-04-29 00:46:12,811 INFO L158 LiptonReduction]: Checked pairs total: 26 [2021-04-29 00:46:12,812 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-29 00:46:12,812 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 957 [2021-04-29 00:46:12,813 INFO L480 AbstractCegarLoop]: Abstraction has has 114 places, 112 transitions, 923 flow [2021-04-29 00:46:12,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:46:12,813 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:46:12,813 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-04-29 00:46:12,813 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-04-29 00:46:12,814 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-04-29 00:46:12,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:46:12,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1566143289, now seen corresponding path program 1 times [2021-04-29 00:46:12,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:46:12,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735293146] [2021-04-29 00:46:12,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:46:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 00:46:12,917 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 00:46:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 00:46:13,014 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 00:46:13,070 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-29 00:46:13,071 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-29 00:46:13,071 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-04-29 00:46:13,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 12:46:13 BasicIcfg [2021-04-29 00:46:13,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-29 00:46:13,220 INFO L168 Benchmark]: Toolchain (without parser) took 220159.88 ms. Allocated memory was 302.0 MB in the beginning and 13.1 GB in the end (delta: 12.8 GB). Free memory was 277.5 MB in the beginning and 10.6 GB in the end (delta: -10.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 16.0 GB. [2021-04-29 00:46:13,220 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 302.0 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-29 00:46:13,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1175.43 ms. Allocated memory is still 302.0 MB. Free memory was 274.3 MB in the beginning and 275.0 MB in the end (delta: -725.2 kB). Peak memory consumption was 34.2 MB. Max. memory is 16.0 GB. [2021-04-29 00:46:13,221 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.42 ms. Allocated memory is still 302.0 MB. Free memory was 275.0 MB in the beginning and 272.9 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-29 00:46:13,221 INFO L168 Benchmark]: Boogie Preprocessor took 79.65 ms. Allocated memory is still 302.0 MB. Free memory was 272.9 MB in the beginning and 269.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:46:13,221 INFO L168 Benchmark]: RCFGBuilder took 4642.50 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 269.8 MB in the beginning and 273.8 MB in the end (delta: -4.0 MB). Peak memory consumption was 199.4 MB. Max. memory is 16.0 GB. [2021-04-29 00:46:13,221 INFO L168 Benchmark]: TraceAbstraction took 214084.39 ms. Allocated memory was 362.8 MB in the beginning and 13.1 GB in the end (delta: 12.7 GB). Free memory was 272.7 MB in the beginning and 10.6 GB in the end (delta: -10.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 16.0 GB. [2021-04-29 00:46:13,222 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.27 ms. Allocated memory is still 302.0 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 1175.43 ms. Allocated memory is still 302.0 MB. Free memory was 274.3 MB in the beginning and 275.0 MB in the end (delta: -725.2 kB). Peak memory consumption was 34.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 102.42 ms. Allocated memory is still 302.0 MB. Free memory was 275.0 MB in the beginning and 272.9 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 79.65 ms. Allocated memory is still 302.0 MB. Free memory was 272.9 MB in the beginning and 269.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 4642.50 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 269.8 MB in the beginning and 273.8 MB in the end (delta: -4.0 MB). Peak memory consumption was 199.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 214084.39 ms. Allocated memory was 362.8 MB in the beginning and 13.1 GB in the end (delta: 12.7 GB). Free memory was 272.7 MB in the beginning and 10.6 GB in the end (delta: -10.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 99615.9ms, 102 PlacesBefore, 126 PlacesAfterwards, 94 TransitionsBefore, 118 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 9 FixpointIterations, 160 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 228 TotalNumberOfCompositions, 15353 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3033, positive: 2748, positive conditional: 2748, positive unconditional: 0, negative: 285, negative conditional: 285, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1572, positive: 1510, positive conditional: 0, positive unconditional: 1510, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1572, positive: 1510, positive conditional: 0, positive unconditional: 1510, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1572, positive: 1492, positive conditional: 0, positive unconditional: 1492, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1984, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 1895, negative conditional: 0, negative unconditional: 1895, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3033, positive: 1238, positive conditional: 1238, positive unconditional: 0, negative: 223, negative conditional: 223, negative unconditional: 0, unknown: 1572, unknown conditional: 1572, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1572, Positive cache size: 1510, Positive conditional cache size: 1510, Positive unconditional cache size: 0, Negative cache size: 62, Negative conditional cache size: 62, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 156.0ms, 122 PlacesBefore, 50 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 932 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 904 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 102, positive: 70, positive conditional: 70, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 141, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 136, negative conditional: 0, negative unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1596, Positive cache size: 1526, Positive conditional cache size: 1526, Positive unconditional cache size: 0, Negative cache size: 70, Negative conditional cache size: 70, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.7ms, 51 PlacesBefore, 49 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 946 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 811 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 77, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 77, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1596, Positive cache size: 1526, Positive conditional cache size: 1526, Positive unconditional cache size: 0, Negative cache size: 70, Negative conditional cache size: 70, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 96.2ms, 51 PlacesBefore, 51 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 938 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 749 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 69, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 75, negative conditional: 75, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1600, Positive cache size: 1529, Positive conditional cache size: 1529, Positive unconditional cache size: 0, Negative cache size: 71, Negative conditional cache size: 71, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 371.0ms, 56 PlacesBefore, 56 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 1164 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 498 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 337, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 337, negative conditional: 0, negative unconditional: 337, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1612, Positive cache size: 1536, Positive conditional cache size: 1536, Positive unconditional cache size: 0, Negative cache size: 76, Negative conditional cache size: 76, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 153.4ms, 64 PlacesBefore, 64 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1448 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 170 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 35, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 35, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1618, Positive cache size: 1541, Positive conditional cache size: 1541, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 131.0ms, 71 PlacesBefore, 71 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 1784 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 100 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 5, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 5, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 16, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1625, Positive cache size: 1548, Positive conditional cache size: 1548, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 129.0ms, 74 PlacesBefore, 74 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 1940 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 110 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1629, Positive cache size: 1552, Positive conditional cache size: 1552, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 211.4ms, 76 PlacesBefore, 76 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 201 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1635, Positive cache size: 1558, Positive conditional cache size: 1558, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 222.9ms, 90 PlacesBefore, 90 PlacesAfterwards, 125 TransitionsBefore, 125 TransitionsAfterwards, 2834 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 616 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 88, positive: 80, positive conditional: 80, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, positive: 72, positive conditional: 72, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1643, Positive cache size: 1566, Positive conditional cache size: 1566, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 274.8ms, 92 PlacesBefore, 92 PlacesAfterwards, 120 TransitionsBefore, 120 TransitionsAfterwards, 2730 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 592 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 88, positive: 80, positive conditional: 80, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 88, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1644, Positive cache size: 1567, Positive conditional cache size: 1567, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 332.3ms, 101 PlacesBefore, 99 PlacesAfterwards, 140 TransitionsBefore, 140 TransitionsAfterwards, 3138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1008 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 144, positive: 132, positive conditional: 132, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 144, positive: 128, positive conditional: 128, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1648, Positive cache size: 1571, Positive conditional cache size: 1571, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 413.6ms, 111 PlacesBefore, 111 PlacesAfterwards, 162 TransitionsBefore, 162 TransitionsAfterwards, 3470 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1632 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 221, positive: 204, positive conditional: 204, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 221, positive: 196, positive conditional: 196, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1656, Positive cache size: 1579, Positive conditional cache size: 1579, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 352.2ms, 125 PlacesBefore, 125 PlacesAfterwards, 230 TransitionsBefore, 230 TransitionsAfterwards, 4094 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2688 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 476, positive: 448, positive conditional: 448, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, 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: 14, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 476, positive: 434, positive conditional: 434, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1670, Positive cache size: 1593, Positive conditional cache size: 1593, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 283.6ms, 132 PlacesBefore, 128 PlacesAfterwards, 205 TransitionsBefore, 205 TransitionsAfterwards, 3574 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2430 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 405, positive: 378, positive conditional: 378, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, 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: 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: 405, positive: 371, positive conditional: 371, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1677, Positive cache size: 1600, Positive conditional cache size: 1600, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 427.3ms, 125 PlacesBefore, 123 PlacesAfterwards, 219 TransitionsBefore, 219 TransitionsAfterwards, 3638 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2494 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 406, positive: 377, positive conditional: 377, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 11, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 406, positive: 366, positive conditional: 366, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1688, Positive cache size: 1611, Positive conditional cache size: 1611, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 279.4ms, 128 PlacesBefore, 128 PlacesAfterwards, 202 TransitionsBefore, 202 TransitionsAfterwards, 3222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1850 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 325, positive: 300, positive conditional: 300, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, 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: 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: 325, positive: 293, positive conditional: 293, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1695, Positive cache size: 1618, Positive conditional cache size: 1618, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 208.2ms, 133 PlacesBefore, 132 PlacesAfterwards, 176 TransitionsBefore, 176 TransitionsAfterwards, 2694 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1488 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 168, positive: 144, positive conditional: 144, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 168, positive: 143, positive conditional: 143, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1696, Positive cache size: 1619, Positive conditional cache size: 1619, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5214.7ms, 126 PlacesBefore, 126 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 2642 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1696, Positive cache size: 1619, Positive conditional cache size: 1619, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4268.7ms, 127 PlacesBefore, 127 PlacesAfterwards, 140 TransitionsBefore, 140 TransitionsAfterwards, 2774 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1696, Positive cache size: 1619, Positive conditional cache size: 1619, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17053.7ms, 128 PlacesBefore, 125 PlacesAfterwards, 119 TransitionsBefore, 120 TransitionsAfterwards, 2232 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 14 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 12, 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: 12, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 14, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1708, Positive cache size: 1631, Positive conditional cache size: 1631, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1150.4ms, 115 PlacesBefore, 112 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 2020 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1708, Positive cache size: 1631, Positive conditional cache size: 1631, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 956.2ms, 113 PlacesBefore, 114 PlacesAfterwards, 111 TransitionsBefore, 112 TransitionsAfterwards, 1792 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 26 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 22, 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: 22, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 26, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1730, Positive cache size: 1653, Positive conditional cache size: 1653, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 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=53, 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 [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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=53, weak$$choice2=0, x=2, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; VAL [\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=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [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}, __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: 17.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 213634.7ms, OverallIterations: 23, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 73775.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 99752.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 93 SDtfs, 128 SDslu, 45 SDs, 0 SdLazy, 1258 SolverSat, 593 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4615.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 6099.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3386occurred in iteration=16, InterpolantAutomatonStates: 142, 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: 120.1ms SsaConstructionTime, 1382.0ms SatisfiabilityAnalysisTime, 5259.3ms InterpolantComputationTime, 350 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 307 ConstructedInterpolants, 0 QuantifiedInterpolants, 3121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...