/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/safe030_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:48:38,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:48:38,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:48:38,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:48:38,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:48:38,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:48:38,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:48:38,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:48:38,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:48:38,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:48:38,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:48:38,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:48:38,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:48:38,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:48:38,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:48:38,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:48:38,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:48:38,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:48:38,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:48:38,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:48:38,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:48:38,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:48:38,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:48:38,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:48:38,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:48:38,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:48:38,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:48:38,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:48:38,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:48:38,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:48:38,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:48:38,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:48:38,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:48:38,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:48:38,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:48:38,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:48:38,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:48:38,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:48:38,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:48:38,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:48:38,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:48:38,239 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-03-26 00:48:38,273 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:48:38,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:48:38,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:48:38,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:48:38,277 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:48:38,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:48:38,278 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:48:38,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:48:38,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:48:38,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:48:38,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:48:38,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:48:38,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:48:38,280 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:48:38,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:48:38,280 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:48:38,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:48:38,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:48:38,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:48:38,281 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:48:38,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:48:38,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:48:38,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:48:38,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:48:38,282 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:48:38,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:48:38,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:48:38,282 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:48:38,282 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:48:38,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:48:38,283 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:48:38,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:48:38,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:48:38,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:48:38,637 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:48:38,638 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:48:38,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i [2021-03-26 00:48:38,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8632ce98e/3cbb387fc94a44beb08f9758511226b5/FLAGeecf45383 [2021-03-26 00:48:39,134 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:48:39,134 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i [2021-03-26 00:48:39,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8632ce98e/3cbb387fc94a44beb08f9758511226b5/FLAGeecf45383 [2021-03-26 00:48:39,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8632ce98e/3cbb387fc94a44beb08f9758511226b5 [2021-03-26 00:48:39,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:48:39,475 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:48:39,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:48:39,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:48:39,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:48:39,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:48:39" (1/1) ... [2021-03-26 00:48:39,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772c3bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:39, skipping insertion in model container [2021-03-26 00:48:39,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:48:39" (1/1) ... [2021-03-26 00:48:39,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:48:39,546 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:48:39,647 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/safe030_power.oepc.i[952,965] [2021-03-26 00:48:39,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:48:39,878 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:48:39,891 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/safe030_power.oepc.i[952,965] [2021-03-26 00:48:39,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:48:40,001 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:48:40,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:40 WrapperNode [2021-03-26 00:48:40,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:48:40,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:48:40,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:48:40,005 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:48:40,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:40" (1/1) ... [2021-03-26 00:48:40,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:40" (1/1) ... [2021-03-26 00:48:40,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:48:40,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:48:40,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:48:40,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:48:40,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:40" (1/1) ... [2021-03-26 00:48:40,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:40" (1/1) ... [2021-03-26 00:48:40,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:40" (1/1) ... [2021-03-26 00:48:40,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:40" (1/1) ... [2021-03-26 00:48:40,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:40" (1/1) ... [2021-03-26 00:48:40,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:40" (1/1) ... [2021-03-26 00:48:40,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:40" (1/1) ... [2021-03-26 00:48:40,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:48:40,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:48:40,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:48:40,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:48:40,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:48:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:48:40,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:48:40,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:48:40,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:48:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:48:40,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:48:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:48:40,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:48:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:48:40,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:48:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:48:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:48:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:48:40,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:48:40,228 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:48:42,040 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:48:42,040 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:48:42,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:48:42 BoogieIcfgContainer [2021-03-26 00:48:42,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:48:42,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:48:42,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:48:42,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:48:42,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:48:39" (1/3) ... [2021-03-26 00:48:42,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43721436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:48:42, skipping insertion in model container [2021-03-26 00:48:42,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:40" (2/3) ... [2021-03-26 00:48:42,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43721436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:48:42, skipping insertion in model container [2021-03-26 00:48:42,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:48:42" (3/3) ... [2021-03-26 00:48:42,050 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc.i [2021-03-26 00:48:42,057 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:48:42,066 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:48:42,067 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:48:42,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,100 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,101 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,101 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,101 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,101 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,102 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,102 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,102 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,107 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,107 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,108 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,108 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,111 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,111 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,111 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,111 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,117 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,118 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,121 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,125 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,133 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,133 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,133 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:42,134 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:48:42,150 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:48:42,175 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:48:42,175 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:48:42,175 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:48:42,175 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:48:42,175 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:48:42,175 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:48:42,175 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:48:42,175 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:48:42,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2021-03-26 00:48:42,231 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-26 00:48:42,232 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:42,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:48:42,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2021-03-26 00:48:42,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2021-03-26 00:48:42,249 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:42,259 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-26 00:48:42,261 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-26 00:48:42,262 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 195 flow [2021-03-26 00:48:42,277 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-26 00:48:42,277 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:42,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:48:42,280 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-26 00:48:44,389 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-03-26 00:48:44,681 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-26 00:48:46,000 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-26 00:48:46,565 WARN L205 SmtUtils]: Spent 558.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 00:48:46,916 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:48:47,335 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-03-26 00:48:47,450 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 00:48:48,575 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 00:48:48,901 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 00:48:49,589 WARN L205 SmtUtils]: Spent 685.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:48:50,225 WARN L205 SmtUtils]: Spent 635.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:48:50,693 INFO L154 LiptonReduction]: Checked pairs total: 3269 [2021-03-26 00:48:50,693 INFO L156 LiptonReduction]: Total number of compositions: 66 [2021-03-26 00:48:50,696 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8448 [2021-03-26 00:48:50,707 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-26 00:48:50,707 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:50,707 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:50,708 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:50,708 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:50,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:50,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1228534299, now seen corresponding path program 1 times [2021-03-26 00:48:50,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:50,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529138721] [2021-03-26 00:48:50,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:50,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:50,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:50,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:50,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:50,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529138721] [2021-03-26 00:48:50,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:50,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:48:50,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987410635] [2021-03-26 00:48:50,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:48:50,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:50,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:48:50,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:48:50,980 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 162 [2021-03-26 00:48:50,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:50,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:50,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 162 [2021-03-26 00:48:50,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:51,091 INFO L129 PetriNetUnfolder]: 69/177 cut-off events. [2021-03-26 00:48:51,092 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:51,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 177 events. 69/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 787 event pairs, 54 based on Foata normal form. 11/169 useless extension candidates. Maximal degree in co-relation 285. Up to 89 conditions per place. [2021-03-26 00:48:51,096 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 9 selfloop transitions, 2 changer transitions 3/40 dead transitions. [2021-03-26 00:48:51,096 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 115 flow [2021-03-26 00:48:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:48:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:48:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2021-03-26 00:48:51,114 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8786008230452675 [2021-03-26 00:48:51,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2021-03-26 00:48:51,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2021-03-26 00:48:51,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:51,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2021-03-26 00:48:51,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:51,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:51,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:51,143 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 427 transitions. [2021-03-26 00:48:51,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 115 flow [2021-03-26 00:48:51,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:48:51,147 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 76 flow [2021-03-26 00:48:51,150 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2021-03-26 00:48:51,151 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 00:48:51,151 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:51,151 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 76 flow [2021-03-26 00:48:51,152 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 76 flow [2021-03-26 00:48:51,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 76 flow [2021-03-26 00:48:51,160 INFO L129 PetriNetUnfolder]: 0/33 cut-off events. [2021-03-26 00:48:51,160 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:51,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:48:51,161 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 00:48:51,823 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 00:48:52,125 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 00:48:52,748 WARN L205 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 00:48:53,339 WARN L205 SmtUtils]: Spent 576.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 00:48:53,831 INFO L154 LiptonReduction]: Checked pairs total: 1218 [2021-03-26 00:48:53,832 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-26 00:48:53,832 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2681 [2021-03-26 00:48:53,833 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 00:48:53,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:53,834 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:53,834 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:53,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:48:53,835 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:53,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:53,835 INFO L82 PathProgramCache]: Analyzing trace with hash 666798904, now seen corresponding path program 1 times [2021-03-26 00:48:53,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:53,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244753460] [2021-03-26 00:48:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:53,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:53,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:53,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:53,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:53,969 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:48:53,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:48:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:53,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244753460] [2021-03-26 00:48:53,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:53,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:53,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825828993] [2021-03-26 00:48:53,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:48:53,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:53,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:48:53,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:48:53,976 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 171 [2021-03-26 00:48:53,977 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:53,977 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:53,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 171 [2021-03-26 00:48:53,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:53,994 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-03-26 00:48:53,994 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:53,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 36 events. 3/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 1 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 46. Up to 10 conditions per place. [2021-03-26 00:48:53,994 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 3 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-26 00:48:53,994 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 74 flow [2021-03-26 00:48:53,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:48:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:48:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2021-03-26 00:48:53,996 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8732943469785575 [2021-03-26 00:48:53,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2021-03-26 00:48:53,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2021-03-26 00:48:53,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:53,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2021-03-26 00:48:53,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:53,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:53,999 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:53,999 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 448 transitions. [2021-03-26 00:48:54,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 74 flow [2021-03-26 00:48:54,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:48:54,001 INFO L241 Difference]: Finished difference. Result has 34 places, 26 transitions, 73 flow [2021-03-26 00:48:54,001 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2021-03-26 00:48:54,001 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -13 predicate places. [2021-03-26 00:48:54,001 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:54,002 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 73 flow [2021-03-26 00:48:54,002 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 73 flow [2021-03-26 00:48:54,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 73 flow [2021-03-26 00:48:54,006 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-03-26 00:48:54,007 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:54,007 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 36 events. 3/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-26 00:48:54,007 INFO L142 LiptonReduction]: Number of co-enabled transitions 270 [2021-03-26 00:48:54,591 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-26 00:48:54,714 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 00:48:54,983 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-26 00:48:55,100 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 00:48:55,104 INFO L154 LiptonReduction]: Checked pairs total: 792 [2021-03-26 00:48:55,104 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:48:55,104 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1103 [2021-03-26 00:48:55,105 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 69 flow [2021-03-26 00:48:55,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,105 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:55,105 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:55,106 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:48:55,106 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:55,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:55,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1655838619, now seen corresponding path program 1 times [2021-03-26 00:48:55,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:55,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429322643] [2021-03-26 00:48:55,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:55,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:55,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:55,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:55,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:55,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429322643] [2021-03-26 00:48:55,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:55,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:48:55,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238900988] [2021-03-26 00:48:55,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:48:55,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:55,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:48:55,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:48:55,217 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 173 [2021-03-26 00:48:55,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:55,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 173 [2021-03-26 00:48:55,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:55,233 INFO L129 PetriNetUnfolder]: 10/56 cut-off events. [2021-03-26 00:48:55,233 INFO L130 PetriNetUnfolder]: For 10/14 co-relation queries the response was YES. [2021-03-26 00:48:55,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 56 events. 10/56 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 181 event pairs, 3 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 92. Up to 19 conditions per place. [2021-03-26 00:48:55,234 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 3 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-26 00:48:55,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 85 flow [2021-03-26 00:48:55,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:48:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:48:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-26 00:48:55,236 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8863198458574181 [2021-03-26 00:48:55,237 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-26 00:48:55,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-26 00:48:55,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:55,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-26 00:48:55,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,240 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 69 flow. Second operand 3 states and 460 transitions. [2021-03-26 00:48:55,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 85 flow [2021-03-26 00:48:55,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 82 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:48:55,241 INFO L241 Difference]: Finished difference. Result has 34 places, 26 transitions, 85 flow [2021-03-26 00:48:55,241 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2021-03-26 00:48:55,241 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -13 predicate places. [2021-03-26 00:48:55,241 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:55,241 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 85 flow [2021-03-26 00:48:55,242 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 85 flow [2021-03-26 00:48:55,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 85 flow [2021-03-26 00:48:55,248 INFO L129 PetriNetUnfolder]: 7/49 cut-off events. [2021-03-26 00:48:55,248 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-03-26 00:48:55,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 49 events. 7/49 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 158 event pairs, 3 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 80. Up to 15 conditions per place. [2021-03-26 00:48:55,249 INFO L142 LiptonReduction]: Number of co-enabled transitions 292 [2021-03-26 00:48:55,250 INFO L154 LiptonReduction]: Checked pairs total: 214 [2021-03-26 00:48:55,250 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:55,251 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-26 00:48:55,252 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 85 flow [2021-03-26 00:48:55,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,252 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:55,252 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:55,252 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:48:55,252 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:55,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:55,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1447535624, now seen corresponding path program 1 times [2021-03-26 00:48:55,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:55,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357460920] [2021-03-26 00:48:55,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:55,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:55,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:55,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:55,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:55,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357460920] [2021-03-26 00:48:55,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:55,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:48:55,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636182486] [2021-03-26 00:48:55,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:48:55,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:55,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:48:55,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:48:55,337 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 173 [2021-03-26 00:48:55,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:55,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 173 [2021-03-26 00:48:55,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:55,354 INFO L129 PetriNetUnfolder]: 4/54 cut-off events. [2021-03-26 00:48:55,354 INFO L130 PetriNetUnfolder]: For 21/34 co-relation queries the response was YES. [2021-03-26 00:48:55,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 54 events. 4/54 cut-off events. For 21/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 1 based on Foata normal form. 3/53 useless extension candidates. Maximal degree in co-relation 99. Up to 15 conditions per place. [2021-03-26 00:48:55,355 INFO L132 encePairwiseOnDemand]: 170/173 looper letters, 3 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-26 00:48:55,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 97 flow [2021-03-26 00:48:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:48:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:48:55,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2021-03-26 00:48:55,357 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.884393063583815 [2021-03-26 00:48:55,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2021-03-26 00:48:55,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2021-03-26 00:48:55,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:55,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2021-03-26 00:48:55,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,360 INFO L185 Difference]: Start difference. First operand has 34 places, 26 transitions, 85 flow. Second operand 3 states and 459 transitions. [2021-03-26 00:48:55,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 97 flow [2021-03-26 00:48:55,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:48:55,361 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 93 flow [2021-03-26 00:48:55,361 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2021-03-26 00:48:55,362 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -11 predicate places. [2021-03-26 00:48:55,362 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:55,362 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 93 flow [2021-03-26 00:48:55,362 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 93 flow [2021-03-26 00:48:55,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 93 flow [2021-03-26 00:48:55,368 INFO L129 PetriNetUnfolder]: 4/47 cut-off events. [2021-03-26 00:48:55,368 INFO L130 PetriNetUnfolder]: For 21/24 co-relation queries the response was YES. [2021-03-26 00:48:55,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 47 events. 4/47 cut-off events. For 21/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 153 event pairs, 2 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 81. Up to 13 conditions per place. [2021-03-26 00:48:55,369 INFO L142 LiptonReduction]: Number of co-enabled transitions 292 [2021-03-26 00:48:55,371 INFO L154 LiptonReduction]: Checked pairs total: 242 [2021-03-26 00:48:55,371 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:55,371 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-26 00:48:55,372 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 93 flow [2021-03-26 00:48:55,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,372 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:55,372 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:55,373 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:48:55,373 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:55,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:55,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1241931901, now seen corresponding path program 1 times [2021-03-26 00:48:55,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:55,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64338882] [2021-03-26 00:48:55,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:55,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:55,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:48:55,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:55,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:48:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:55,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64338882] [2021-03-26 00:48:55,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:55,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:48:55,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075048431] [2021-03-26 00:48:55,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:48:55,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:55,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:48:55,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:48:55,443 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 173 [2021-03-26 00:48:55,444 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:55,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 173 [2021-03-26 00:48:55,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:55,556 INFO L129 PetriNetUnfolder]: 187/409 cut-off events. [2021-03-26 00:48:55,556 INFO L130 PetriNetUnfolder]: For 287/332 co-relation queries the response was YES. [2021-03-26 00:48:55,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 409 events. 187/409 cut-off events. For 287/332 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2310 event pairs, 142 based on Foata normal form. 3/375 useless extension candidates. Maximal degree in co-relation 886. Up to 296 conditions per place. [2021-03-26 00:48:55,561 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 9 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-03-26 00:48:55,561 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 125 flow [2021-03-26 00:48:55,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:48:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:48:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2021-03-26 00:48:55,563 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7880539499036608 [2021-03-26 00:48:55,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2021-03-26 00:48:55,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2021-03-26 00:48:55,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:55,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2021-03-26 00:48:55,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,566 INFO L185 Difference]: Start difference. First operand has 36 places, 26 transitions, 93 flow. Second operand 3 states and 409 transitions. [2021-03-26 00:48:55,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 125 flow [2021-03-26 00:48:55,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 120 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:48:55,570 INFO L241 Difference]: Finished difference. Result has 38 places, 28 transitions, 107 flow [2021-03-26 00:48:55,570 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2021-03-26 00:48:55,570 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -9 predicate places. [2021-03-26 00:48:55,570 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:55,571 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 107 flow [2021-03-26 00:48:55,571 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 107 flow [2021-03-26 00:48:55,571 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 107 flow [2021-03-26 00:48:55,580 INFO L129 PetriNetUnfolder]: 15/83 cut-off events. [2021-03-26 00:48:55,580 INFO L130 PetriNetUnfolder]: For 79/86 co-relation queries the response was YES. [2021-03-26 00:48:55,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 83 events. 15/83 cut-off events. For 79/86 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 355 event pairs, 6 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 172. Up to 27 conditions per place. [2021-03-26 00:48:55,581 INFO L142 LiptonReduction]: Number of co-enabled transitions 314 [2021-03-26 00:48:55,584 INFO L154 LiptonReduction]: Checked pairs total: 192 [2021-03-26 00:48:55,584 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:55,584 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-03-26 00:48:55,586 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 107 flow [2021-03-26 00:48:55,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,588 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:55,588 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:55,588 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:48:55,588 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:55,589 INFO L82 PathProgramCache]: Analyzing trace with hash -307590703, now seen corresponding path program 1 times [2021-03-26 00:48:55,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:55,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276276574] [2021-03-26 00:48:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:55,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:55,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:55,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:55,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:55,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276276574] [2021-03-26 00:48:55,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:55,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:48:55,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733121510] [2021-03-26 00:48:55,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:48:55,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:55,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:48:55,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:48:55,667 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 173 [2021-03-26 00:48:55,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:55,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 173 [2021-03-26 00:48:55,668 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:55,693 INFO L129 PetriNetUnfolder]: 8/89 cut-off events. [2021-03-26 00:48:55,693 INFO L130 PetriNetUnfolder]: For 196/252 co-relation queries the response was YES. [2021-03-26 00:48:55,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 89 events. 8/89 cut-off events. For 196/252 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 431 event pairs, 4 based on Foata normal form. 4/89 useless extension candidates. Maximal degree in co-relation 187. Up to 25 conditions per place. [2021-03-26 00:48:55,694 INFO L132 encePairwiseOnDemand]: 170/173 looper letters, 3 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-03-26 00:48:55,694 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 28 transitions, 119 flow [2021-03-26 00:48:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:48:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:48:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2021-03-26 00:48:55,696 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.884393063583815 [2021-03-26 00:48:55,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2021-03-26 00:48:55,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2021-03-26 00:48:55,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:55,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2021-03-26 00:48:55,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,699 INFO L185 Difference]: Start difference. First operand has 38 places, 28 transitions, 107 flow. Second operand 3 states and 459 transitions. [2021-03-26 00:48:55,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 28 transitions, 119 flow [2021-03-26 00:48:55,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:48:55,702 INFO L241 Difference]: Finished difference. Result has 40 places, 28 transitions, 115 flow [2021-03-26 00:48:55,702 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2021-03-26 00:48:55,702 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2021-03-26 00:48:55,702 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:55,703 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 115 flow [2021-03-26 00:48:55,703 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 115 flow [2021-03-26 00:48:55,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 115 flow [2021-03-26 00:48:55,716 INFO L129 PetriNetUnfolder]: 8/89 cut-off events. [2021-03-26 00:48:55,717 INFO L130 PetriNetUnfolder]: For 126/150 co-relation queries the response was YES. [2021-03-26 00:48:55,717 INFO L84 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 89 events. 8/89 cut-off events. For 126/150 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 428 event pairs, 4 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 184. Up to 25 conditions per place. [2021-03-26 00:48:55,718 INFO L142 LiptonReduction]: Number of co-enabled transitions 314 [2021-03-26 00:48:55,723 INFO L154 LiptonReduction]: Checked pairs total: 218 [2021-03-26 00:48:55,723 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:55,723 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-26 00:48:55,726 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 115 flow [2021-03-26 00:48:55,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,727 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:55,727 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:55,727 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:48:55,727 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:55,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:55,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1000743344, now seen corresponding path program 1 times [2021-03-26 00:48:55,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:55,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790260509] [2021-03-26 00:48:55,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:55,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:55,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:55,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:55,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:48:55,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:55,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:55,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790260509] [2021-03-26 00:48:55,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:55,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:55,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133341930] [2021-03-26 00:48:55,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:48:55,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:55,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:48:55,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:48:55,843 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 173 [2021-03-26 00:48:55,843 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:55,844 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:55,844 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 173 [2021-03-26 00:48:55,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:56,023 INFO L129 PetriNetUnfolder]: 214/477 cut-off events. [2021-03-26 00:48:56,023 INFO L130 PetriNetUnfolder]: For 638/750 co-relation queries the response was YES. [2021-03-26 00:48:56,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 477 events. 214/477 cut-off events. For 638/750 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2793 event pairs, 75 based on Foata normal form. 12/457 useless extension candidates. Maximal degree in co-relation 1126. Up to 353 conditions per place. [2021-03-26 00:48:56,026 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 10 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2021-03-26 00:48:56,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 161 flow [2021-03-26 00:48:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:48:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:48:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2021-03-26 00:48:56,029 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7644508670520231 [2021-03-26 00:48:56,029 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2021-03-26 00:48:56,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2021-03-26 00:48:56,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:56,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2021-03-26 00:48:56,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:56,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:56,033 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:56,033 INFO L185 Difference]: Start difference. First operand has 40 places, 28 transitions, 115 flow. Second operand 4 states and 529 transitions. [2021-03-26 00:48:56,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 161 flow [2021-03-26 00:48:56,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 34 transitions, 156 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:48:56,036 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 142 flow [2021-03-26 00:48:56,036 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2021-03-26 00:48:56,036 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2021-03-26 00:48:56,036 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:56,036 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 142 flow [2021-03-26 00:48:56,036 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 142 flow [2021-03-26 00:48:56,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 142 flow [2021-03-26 00:48:56,061 INFO L129 PetriNetUnfolder]: 47/187 cut-off events. [2021-03-26 00:48:56,061 INFO L130 PetriNetUnfolder]: For 342/404 co-relation queries the response was YES. [2021-03-26 00:48:56,062 INFO L84 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 187 events. 47/187 cut-off events. For 342/404 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1080 event pairs, 19 based on Foata normal form. 1/175 useless extension candidates. Maximal degree in co-relation 459. Up to 98 conditions per place. [2021-03-26 00:48:56,064 INFO L142 LiptonReduction]: Number of co-enabled transitions 348 [2021-03-26 00:48:56,156 INFO L154 LiptonReduction]: Checked pairs total: 84 [2021-03-26 00:48:56,156 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:56,156 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 120 [2021-03-26 00:48:56,157 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 142 flow [2021-03-26 00:48:56,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:56,157 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:56,157 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:56,158 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:48:56,158 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:56,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:56,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1254957998, now seen corresponding path program 1 times [2021-03-26 00:48:56,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:56,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390145045] [2021-03-26 00:48:56,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:56,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:56,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:56,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:56,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:48:56,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:56,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:48:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:56,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390145045] [2021-03-26 00:48:56,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:56,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:56,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821378656] [2021-03-26 00:48:56,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:48:56,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:56,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:48:56,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:48:56,260 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 173 [2021-03-26 00:48:56,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:56,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:56,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 173 [2021-03-26 00:48:56,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:56,413 INFO L129 PetriNetUnfolder]: 210/488 cut-off events. [2021-03-26 00:48:56,413 INFO L130 PetriNetUnfolder]: For 873/1065 co-relation queries the response was YES. [2021-03-26 00:48:56,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 488 events. 210/488 cut-off events. For 873/1065 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2974 event pairs, 46 based on Foata normal form. 21/484 useless extension candidates. Maximal degree in co-relation 1355. Up to 314 conditions per place. [2021-03-26 00:48:56,417 INFO L132 encePairwiseOnDemand]: 166/173 looper letters, 12 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2021-03-26 00:48:56,417 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 202 flow [2021-03-26 00:48:56,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:48:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:48:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2021-03-26 00:48:56,419 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8121387283236994 [2021-03-26 00:48:56,419 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2021-03-26 00:48:56,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2021-03-26 00:48:56,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:56,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2021-03-26 00:48:56,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:56,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:56,422 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:56,422 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 142 flow. Second operand 4 states and 562 transitions. [2021-03-26 00:48:56,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 202 flow [2021-03-26 00:48:56,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 192 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:48:56,425 INFO L241 Difference]: Finished difference. Result has 46 places, 35 transitions, 182 flow [2021-03-26 00:48:56,426 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2021-03-26 00:48:56,426 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2021-03-26 00:48:56,426 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:56,426 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 35 transitions, 182 flow [2021-03-26 00:48:56,426 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 35 transitions, 182 flow [2021-03-26 00:48:56,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 182 flow [2021-03-26 00:48:56,478 INFO L129 PetriNetUnfolder]: 149/407 cut-off events. [2021-03-26 00:48:56,478 INFO L130 PetriNetUnfolder]: For 987/1089 co-relation queries the response was YES. [2021-03-26 00:48:56,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 407 events. 149/407 cut-off events. For 987/1089 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2659 event pairs, 82 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 1113. Up to 188 conditions per place. [2021-03-26 00:48:56,483 INFO L142 LiptonReduction]: Number of co-enabled transitions 366 [2021-03-26 00:48:56,498 INFO L154 LiptonReduction]: Checked pairs total: 24 [2021-03-26 00:48:56,498 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:56,498 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 72 [2021-03-26 00:48:56,501 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 182 flow [2021-03-26 00:48:56,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:56,501 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:56,501 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:56,501 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:48:56,501 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:56,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:56,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1760274217, now seen corresponding path program 1 times [2021-03-26 00:48:56,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:56,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492278415] [2021-03-26 00:48:56,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:56,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:56,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:48:56,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:56,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:48:56,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:56,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:48:56,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:56,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:56,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492278415] [2021-03-26 00:48:56,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:56,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:56,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395420985] [2021-03-26 00:48:56,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:48:56,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:56,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:48:56,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:48:56,580 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 173 [2021-03-26 00:48:56,580 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:56,580 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:56,581 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 173 [2021-03-26 00:48:56,581 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:56,742 INFO L129 PetriNetUnfolder]: 250/561 cut-off events. [2021-03-26 00:48:56,742 INFO L130 PetriNetUnfolder]: For 1400/1642 co-relation queries the response was YES. [2021-03-26 00:48:56,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 561 events. 250/561 cut-off events. For 1400/1642 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3448 event pairs, 53 based on Foata normal form. 27/556 useless extension candidates. Maximal degree in co-relation 1856. Up to 338 conditions per place. [2021-03-26 00:48:56,746 INFO L132 encePairwiseOnDemand]: 165/173 looper letters, 10 selfloop transitions, 14 changer transitions 0/42 dead transitions. [2021-03-26 00:48:56,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 262 flow [2021-03-26 00:48:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:48:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:48:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 813 transitions. [2021-03-26 00:48:56,749 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7832369942196532 [2021-03-26 00:48:56,749 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 813 transitions. [2021-03-26 00:48:56,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 813 transitions. [2021-03-26 00:48:56,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:56,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 813 transitions. [2021-03-26 00:48:56,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:56,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:56,753 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:56,754 INFO L185 Difference]: Start difference. First operand has 46 places, 35 transitions, 182 flow. Second operand 6 states and 813 transitions. [2021-03-26 00:48:56,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 262 flow [2021-03-26 00:48:56,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 254 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 00:48:56,758 INFO L241 Difference]: Finished difference. Result has 51 places, 39 transitions, 237 flow [2021-03-26 00:48:56,758 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2021-03-26 00:48:56,758 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2021-03-26 00:48:56,758 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:56,758 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 39 transitions, 237 flow [2021-03-26 00:48:56,758 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 39 transitions, 237 flow [2021-03-26 00:48:56,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 39 transitions, 237 flow [2021-03-26 00:48:56,821 INFO L129 PetriNetUnfolder]: 234/548 cut-off events. [2021-03-26 00:48:56,821 INFO L130 PetriNetUnfolder]: For 1278/1403 co-relation queries the response was YES. [2021-03-26 00:48:56,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 548 events. 234/548 cut-off events. For 1278/1403 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3576 event pairs, 74 based on Foata normal form. 2/510 useless extension candidates. Maximal degree in co-relation 1826. Up to 319 conditions per place. [2021-03-26 00:48:56,827 INFO L142 LiptonReduction]: Number of co-enabled transitions 408 [2021-03-26 00:48:56,870 INFO L154 LiptonReduction]: Checked pairs total: 27 [2021-03-26 00:48:56,870 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:56,870 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 112 [2021-03-26 00:48:56,871 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 237 flow [2021-03-26 00:48:56,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:56,872 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:56,872 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:56,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:48:56,872 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:56,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:56,872 INFO L82 PathProgramCache]: Analyzing trace with hash -831370021, now seen corresponding path program 2 times [2021-03-26 00:48:56,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:56,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479725185] [2021-03-26 00:48:56,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:56,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:56,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:48:56,950 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 00:48:56,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 00:48:56,972 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-03-26 00:48:56,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 00:48:56,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:56,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 00:48:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:57,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479725185] [2021-03-26 00:48:57,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:57,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:57,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583108349] [2021-03-26 00:48:57,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:48:57,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:57,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:48:57,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:48:57,003 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 173 [2021-03-26 00:48:57,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:57,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:57,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 173 [2021-03-26 00:48:57,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:57,217 INFO L129 PetriNetUnfolder]: 281/655 cut-off events. [2021-03-26 00:48:57,218 INFO L130 PetriNetUnfolder]: For 1931/2296 co-relation queries the response was YES. [2021-03-26 00:48:57,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 655 events. 281/655 cut-off events. For 1931/2296 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4309 event pairs, 26 based on Foata normal form. 31/661 useless extension candidates. Maximal degree in co-relation 2656. Up to 383 conditions per place. [2021-03-26 00:48:57,222 INFO L132 encePairwiseOnDemand]: 166/173 looper letters, 19 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2021-03-26 00:48:57,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 369 flow [2021-03-26 00:48:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2021-03-26 00:48:57,225 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.776878612716763 [2021-03-26 00:48:57,225 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2021-03-26 00:48:57,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2021-03-26 00:48:57,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:57,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2021-03-26 00:48:57,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:57,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 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-03-26 00:48:57,229 INFO L81 ComplementDD]: Finished complementDD. Result has 6 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-03-26 00:48:57,229 INFO L185 Difference]: Start difference. First operand has 51 places, 39 transitions, 237 flow. Second operand 5 states and 672 transitions. [2021-03-26 00:48:57,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 369 flow [2021-03-26 00:48:57,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 336 flow, removed 10 selfloop flow, removed 3 redundant places. [2021-03-26 00:48:57,235 INFO L241 Difference]: Finished difference. Result has 53 places, 45 transitions, 295 flow [2021-03-26 00:48:57,236 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=295, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2021-03-26 00:48:57,236 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2021-03-26 00:48:57,236 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:57,236 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 295 flow [2021-03-26 00:48:57,236 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 295 flow [2021-03-26 00:48:57,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 295 flow [2021-03-26 00:48:57,309 INFO L129 PetriNetUnfolder]: 267/617 cut-off events. [2021-03-26 00:48:57,310 INFO L130 PetriNetUnfolder]: For 2014/2170 co-relation queries the response was YES. [2021-03-26 00:48:57,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2397 conditions, 617 events. 267/617 cut-off events. For 2014/2170 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4046 event pairs, 65 based on Foata normal form. 4/579 useless extension candidates. Maximal degree in co-relation 2376. Up to 371 conditions per place. [2021-03-26 00:48:57,317 INFO L142 LiptonReduction]: Number of co-enabled transitions 464 [2021-03-26 00:48:57,345 INFO L154 LiptonReduction]: Checked pairs total: 109 [2021-03-26 00:48:57,345 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:57,345 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 109 [2021-03-26 00:48:57,345 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 295 flow [2021-03-26 00:48:57,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:57,346 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:57,346 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:57,346 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:48:57,346 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:57,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:57,347 INFO L82 PathProgramCache]: Analyzing trace with hash -248992643, now seen corresponding path program 3 times [2021-03-26 00:48:57,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:57,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440038748] [2021-03-26 00:48:57,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:57,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:57,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:57,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:57,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:48:57,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:57,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:48:57,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:57,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:48:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:57,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440038748] [2021-03-26 00:48:57,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:57,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:48:57,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087614782] [2021-03-26 00:48:57,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:48:57,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:57,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:48:57,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:48:57,423 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 173 [2021-03-26 00:48:57,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:57,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:57,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 173 [2021-03-26 00:48:57,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:57,591 INFO L129 PetriNetUnfolder]: 294/651 cut-off events. [2021-03-26 00:48:57,591 INFO L130 PetriNetUnfolder]: For 2828/3279 co-relation queries the response was YES. [2021-03-26 00:48:57,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3070 conditions, 651 events. 294/651 cut-off events. For 2828/3279 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4154 event pairs, 45 based on Foata normal form. 56/675 useless extension candidates. Maximal degree in co-relation 3047. Up to 407 conditions per place. [2021-03-26 00:48:57,596 INFO L132 encePairwiseOnDemand]: 165/173 looper letters, 19 selfloop transitions, 22 changer transitions 0/59 dead transitions. [2021-03-26 00:48:57,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 59 transitions, 491 flow [2021-03-26 00:48:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2021-03-26 00:48:57,599 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7884393063583816 [2021-03-26 00:48:57,599 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2021-03-26 00:48:57,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2021-03-26 00:48:57,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:57,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2021-03-26 00:48:57,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:57,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 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-03-26 00:48:57,603 INFO L81 ComplementDD]: Finished complementDD. Result has 6 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-03-26 00:48:57,604 INFO L185 Difference]: Start difference. First operand has 53 places, 45 transitions, 295 flow. Second operand 5 states and 682 transitions. [2021-03-26 00:48:57,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 59 transitions, 491 flow [2021-03-26 00:48:57,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 470 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-03-26 00:48:57,609 INFO L241 Difference]: Finished difference. Result has 56 places, 54 transitions, 434 flow [2021-03-26 00:48:57,610 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=434, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2021-03-26 00:48:57,610 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2021-03-26 00:48:57,610 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:57,610 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 54 transitions, 434 flow [2021-03-26 00:48:57,610 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 54 transitions, 434 flow [2021-03-26 00:48:57,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 54 transitions, 434 flow [2021-03-26 00:48:57,686 INFO L129 PetriNetUnfolder]: 279/633 cut-off events. [2021-03-26 00:48:57,686 INFO L130 PetriNetUnfolder]: For 2738/3071 co-relation queries the response was YES. [2021-03-26 00:48:57,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2947 conditions, 633 events. 279/633 cut-off events. For 2738/3071 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4112 event pairs, 42 based on Foata normal form. 21/615 useless extension candidates. Maximal degree in co-relation 2925. Up to 390 conditions per place. [2021-03-26 00:48:57,694 INFO L142 LiptonReduction]: Number of co-enabled transitions 526 [2021-03-26 00:48:57,943 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 00:48:58,334 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-26 00:48:58,443 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-26 00:48:58,510 INFO L154 LiptonReduction]: Checked pairs total: 617 [2021-03-26 00:48:58,511 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:48:58,511 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 901 [2021-03-26 00:48:58,512 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 436 flow [2021-03-26 00:48:58,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:58,512 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:58,512 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:58,512 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:48:58,512 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:58,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:58,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2108340173, now seen corresponding path program 1 times [2021-03-26 00:48:58,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:58,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332549146] [2021-03-26 00:48:58,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:58,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:58,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:58,555 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:48:58,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:48:58,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:58,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:58,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332549146] [2021-03-26 00:48:58,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:58,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:58,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727866141] [2021-03-26 00:48:58,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:48:58,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:58,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:48:58,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:48:58,564 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 174 [2021-03-26 00:48:58,564 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 436 flow. Second operand has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:58,564 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:58,564 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 174 [2021-03-26 00:48:58,564 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:58,766 INFO L129 PetriNetUnfolder]: 593/1252 cut-off events. [2021-03-26 00:48:58,766 INFO L130 PetriNetUnfolder]: For 3779/4427 co-relation queries the response was YES. [2021-03-26 00:48:58,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4538 conditions, 1252 events. 593/1252 cut-off events. For 3779/4427 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 9231 event pairs, 144 based on Foata normal form. 270/1307 useless extension candidates. Maximal degree in co-relation 4514. Up to 663 conditions per place. [2021-03-26 00:48:58,777 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 12 selfloop transitions, 8 changer transitions 1/64 dead transitions. [2021-03-26 00:48:58,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 488 flow [2021-03-26 00:48:58,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 720 transitions. [2021-03-26 00:48:58,780 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8275862068965517 [2021-03-26 00:48:58,780 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 720 transitions. [2021-03-26 00:48:58,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 720 transitions. [2021-03-26 00:48:58,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:58,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 720 transitions. [2021-03-26 00:48:58,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:58,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:58,784 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:58,784 INFO L185 Difference]: Start difference. First operand has 56 places, 54 transitions, 436 flow. Second operand 5 states and 720 transitions. [2021-03-26 00:48:58,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 488 flow [2021-03-26 00:48:58,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 460 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-26 00:48:58,792 INFO L241 Difference]: Finished difference. Result has 60 places, 59 transitions, 457 flow [2021-03-26 00:48:58,792 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=457, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2021-03-26 00:48:58,793 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2021-03-26 00:48:58,793 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:58,793 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 59 transitions, 457 flow [2021-03-26 00:48:58,793 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 59 transitions, 457 flow [2021-03-26 00:48:58,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 59 transitions, 457 flow [2021-03-26 00:48:58,907 INFO L129 PetriNetUnfolder]: 490/1082 cut-off events. [2021-03-26 00:48:58,907 INFO L130 PetriNetUnfolder]: For 4245/4752 co-relation queries the response was YES. [2021-03-26 00:48:58,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4640 conditions, 1082 events. 490/1082 cut-off events. For 4245/4752 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 7962 event pairs, 143 based on Foata normal form. 78/1071 useless extension candidates. Maximal degree in co-relation 4615. Up to 475 conditions per place. [2021-03-26 00:48:58,922 INFO L142 LiptonReduction]: Number of co-enabled transitions 656 [2021-03-26 00:48:58,932 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:48:58,932 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:58,932 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 139 [2021-03-26 00:48:58,934 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 457 flow [2021-03-26 00:48:58,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:58,935 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:58,935 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:58,935 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:48:58,935 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:58,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:58,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1965447650, now seen corresponding path program 1 times [2021-03-26 00:48:58,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:58,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906475111] [2021-03-26 00:48:58,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:58,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:58,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:58,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:58,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:58,982 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:48:58,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:48:58,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:58,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:58,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906475111] [2021-03-26 00:48:58,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:58,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:48:58,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839709579] [2021-03-26 00:48:58,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:48:58,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:58,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:48:58,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:48:58,994 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 174 [2021-03-26 00:48:58,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 457 flow. Second operand has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:58,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:58,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 174 [2021-03-26 00:48:58,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:59,145 INFO L129 PetriNetUnfolder]: 339/843 cut-off events. [2021-03-26 00:48:59,145 INFO L130 PetriNetUnfolder]: For 3481/5692 co-relation queries the response was YES. [2021-03-26 00:48:59,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3500 conditions, 843 events. 339/843 cut-off events. For 3481/5692 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 6475 event pairs, 24 based on Foata normal form. 550/1285 useless extension candidates. Maximal degree in co-relation 3473. Up to 449 conditions per place. [2021-03-26 00:48:59,153 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 9 selfloop transitions, 15 changer transitions 3/67 dead transitions. [2021-03-26 00:48:59,153 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 67 transitions, 536 flow [2021-03-26 00:48:59,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:48:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:48:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1008 transitions. [2021-03-26 00:48:59,156 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8275862068965517 [2021-03-26 00:48:59,156 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1008 transitions. [2021-03-26 00:48:59,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1008 transitions. [2021-03-26 00:48:59,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:59,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1008 transitions. [2021-03-26 00:48:59,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.0) internal successors, (1008), 7 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:59,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:59,161 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:59,161 INFO L185 Difference]: Start difference. First operand has 60 places, 59 transitions, 457 flow. Second operand 7 states and 1008 transitions. [2021-03-26 00:48:59,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 67 transitions, 536 flow [2021-03-26 00:48:59,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 67 transitions, 532 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:48:59,170 INFO L241 Difference]: Finished difference. Result has 68 places, 62 transitions, 519 flow [2021-03-26 00:48:59,170 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=519, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2021-03-26 00:48:59,171 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 21 predicate places. [2021-03-26 00:48:59,171 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:59,171 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 62 transitions, 519 flow [2021-03-26 00:48:59,171 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 62 transitions, 519 flow [2021-03-26 00:48:59,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 62 transitions, 519 flow [2021-03-26 00:48:59,243 INFO L129 PetriNetUnfolder]: 215/637 cut-off events. [2021-03-26 00:48:59,243 INFO L130 PetriNetUnfolder]: For 3420/4004 co-relation queries the response was YES. [2021-03-26 00:48:59,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3029 conditions, 637 events. 215/637 cut-off events. For 3420/4004 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5010 event pairs, 24 based on Foata normal form. 66/663 useless extension candidates. Maximal degree in co-relation 3000. Up to 317 conditions per place. [2021-03-26 00:48:59,253 INFO L142 LiptonReduction]: Number of co-enabled transitions 698 [2021-03-26 00:48:59,260 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:48:59,260 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:59,260 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 89 [2021-03-26 00:48:59,261 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 519 flow [2021-03-26 00:48:59,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:59,261 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:59,261 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:59,261 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:48:59,261 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:59,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:59,262 INFO L82 PathProgramCache]: Analyzing trace with hash -188248036, now seen corresponding path program 1 times [2021-03-26 00:48:59,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:59,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410910332] [2021-03-26 00:48:59,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:59,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:59,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:59,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:59,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:59,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:59,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:59,320 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:48:59,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:48:59,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:59,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:59,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410910332] [2021-03-26 00:48:59,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:59,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:48:59,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428861571] [2021-03-26 00:48:59,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:48:59,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:59,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:48:59,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:48:59,331 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 174 [2021-03-26 00:48:59,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 519 flow. Second operand has 6 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:59,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:59,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 174 [2021-03-26 00:48:59,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:59,497 INFO L129 PetriNetUnfolder]: 281/728 cut-off events. [2021-03-26 00:48:59,497 INFO L130 PetriNetUnfolder]: For 5396/7926 co-relation queries the response was YES. [2021-03-26 00:48:59,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 728 events. 281/728 cut-off events. For 5396/7926 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 5647 event pairs, 7 based on Foata normal form. 528/1152 useless extension candidates. Maximal degree in co-relation 3465. Up to 411 conditions per place. [2021-03-26 00:48:59,505 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 5 selfloop transitions, 19 changer transitions 13/67 dead transitions. [2021-03-26 00:48:59,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 589 flow [2021-03-26 00:48:59,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:48:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:48:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1290 transitions. [2021-03-26 00:48:59,508 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8237547892720306 [2021-03-26 00:48:59,508 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1290 transitions. [2021-03-26 00:48:59,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1290 transitions. [2021-03-26 00:48:59,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:59,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1290 transitions. [2021-03-26 00:48:59,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 143.33333333333334) internal successors, (1290), 9 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:59,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 174.0) internal successors, (1740), 10 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:59,515 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 174.0) internal successors, (1740), 10 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:59,515 INFO L185 Difference]: Start difference. First operand has 68 places, 62 transitions, 519 flow. Second operand 9 states and 1290 transitions. [2021-03-26 00:48:59,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 67 transitions, 589 flow [2021-03-26 00:48:59,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 67 transitions, 504 flow, removed 30 selfloop flow, removed 4 redundant places. [2021-03-26 00:48:59,529 INFO L241 Difference]: Finished difference. Result has 75 places, 52 transitions, 413 flow [2021-03-26 00:48:59,529 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=413, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2021-03-26 00:48:59,529 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2021-03-26 00:48:59,529 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:59,530 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 52 transitions, 413 flow [2021-03-26 00:48:59,530 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 52 transitions, 413 flow [2021-03-26 00:48:59,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 52 transitions, 413 flow [2021-03-26 00:48:59,572 INFO L129 PetriNetUnfolder]: 64/223 cut-off events. [2021-03-26 00:48:59,572 INFO L130 PetriNetUnfolder]: For 991/1063 co-relation queries the response was YES. [2021-03-26 00:48:59,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 223 events. 64/223 cut-off events. For 991/1063 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1411 event pairs, 2 based on Foata normal form. 17/228 useless extension candidates. Maximal degree in co-relation 941. Up to 60 conditions per place. [2021-03-26 00:48:59,579 INFO L142 LiptonReduction]: Number of co-enabled transitions 426 [2021-03-26 00:49:00,256 WARN L205 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 180 [2021-03-26 00:49:00,463 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2021-03-26 00:49:01,805 WARN L205 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 335 DAG size of output: 260 [2021-03-26 00:49:02,370 WARN L205 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 240 [2021-03-26 00:49:02,778 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-03-26 00:49:03,048 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-03-26 00:49:03,348 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:49:03,587 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:49:04,117 WARN L205 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 00:49:04,637 WARN L205 SmtUtils]: Spent 519.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 00:49:04,644 INFO L154 LiptonReduction]: Checked pairs total: 123 [2021-03-26 00:49:04,644 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-26 00:49:04,644 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5115 [2021-03-26 00:49:04,645 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 393 flow [2021-03-26 00:49:04,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:04,645 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:04,645 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:04,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:49:04,645 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:04,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:04,646 INFO L82 PathProgramCache]: Analyzing trace with hash 511186675, now seen corresponding path program 1 times [2021-03-26 00:49:04,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:04,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115042905] [2021-03-26 00:49:04,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:04,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:04,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:49:04,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:04,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 00:49:04,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:04,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:49:04,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:04,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:49:04,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:04,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:49:04,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:04,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:49:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:04,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115042905] [2021-03-26 00:49:04,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:04,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:49:04,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093211824] [2021-03-26 00:49:04,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:49:04,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:04,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:49:04,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:49:04,793 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 181 [2021-03-26 00:49:04,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 45 transitions, 393 flow. Second operand has 8 states, 8 states have (on average 124.0) internal successors, (992), 8 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:04,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:04,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 181 [2021-03-26 00:49:04,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:04,947 INFO L129 PetriNetUnfolder]: 50/151 cut-off events. [2021-03-26 00:49:04,947 INFO L130 PetriNetUnfolder]: For 908/974 co-relation queries the response was YES. [2021-03-26 00:49:04,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 151 events. 50/151 cut-off events. For 908/974 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 705 event pairs, 0 based on Foata normal form. 27/169 useless extension candidates. Maximal degree in co-relation 711. Up to 53 conditions per place. [2021-03-26 00:49:04,949 INFO L132 encePairwiseOnDemand]: 174/181 looper letters, 9 selfloop transitions, 7 changer transitions 10/43 dead transitions. [2021-03-26 00:49:04,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 43 transitions, 421 flow [2021-03-26 00:49:04,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:49:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:49:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 877 transitions. [2021-03-26 00:49:04,952 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6921862667719021 [2021-03-26 00:49:04,953 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 877 transitions. [2021-03-26 00:49:04,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 877 transitions. [2021-03-26 00:49:04,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:04,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 877 transitions. [2021-03-26 00:49:04,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:04,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:04,957 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:04,957 INFO L185 Difference]: Start difference. First operand has 70 places, 45 transitions, 393 flow. Second operand 7 states and 877 transitions. [2021-03-26 00:49:04,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 43 transitions, 421 flow [2021-03-26 00:49:04,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 43 transitions, 349 flow, removed 19 selfloop flow, removed 14 redundant places. [2021-03-26 00:49:04,961 INFO L241 Difference]: Finished difference. Result has 56 places, 31 transitions, 227 flow [2021-03-26 00:49:04,961 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=227, PETRI_PLACES=56, PETRI_TRANSITIONS=31} [2021-03-26 00:49:04,961 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2021-03-26 00:49:04,961 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:04,961 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 31 transitions, 227 flow [2021-03-26 00:49:04,962 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 31 transitions, 227 flow [2021-03-26 00:49:04,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 31 transitions, 227 flow [2021-03-26 00:49:04,968 INFO L129 PetriNetUnfolder]: 14/49 cut-off events. [2021-03-26 00:49:04,969 INFO L130 PetriNetUnfolder]: For 146/148 co-relation queries the response was YES. [2021-03-26 00:49:04,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 49 events. 14/49 cut-off events. For 146/148 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 112 event pairs, 1 based on Foata normal form. 2/51 useless extension candidates. Maximal degree in co-relation 177. Up to 16 conditions per place. [2021-03-26 00:49:04,970 INFO L142 LiptonReduction]: Number of co-enabled transitions 100 [2021-03-26 00:49:05,207 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2021-03-26 00:49:05,603 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 90 [2021-03-26 00:49:05,734 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-26 00:49:05,739 INFO L154 LiptonReduction]: Checked pairs total: 10 [2021-03-26 00:49:05,739 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:49:05,740 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 779 [2021-03-26 00:49:05,743 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 30 transitions, 233 flow [2021-03-26 00:49:05,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 124.0) internal successors, (992), 8 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:05,744 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:05,744 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:05,744 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:49:05,744 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:05,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:05,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1547250832, now seen corresponding path program 1 times [2021-03-26 00:49:05,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:05,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728968296] [2021-03-26 00:49:05,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:49:05,786 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:49:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:49:05,822 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:49:05,863 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:49:05,864 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:49:05,865 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 00:49:05,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:49:05 BasicIcfg [2021-03-26 00:49:05,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:49:05,950 INFO L168 Benchmark]: Toolchain (without parser) took 26475.20 ms. Allocated memory was 255.9 MB in the beginning and 796.9 MB in the end (delta: 541.1 MB). Free memory was 233.2 MB in the beginning and 489.7 MB in the end (delta: -256.5 MB). Peak memory consumption was 284.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:49:05,950 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 255.9 MB. Free memory was 237.7 MB in the beginning and 237.5 MB in the end (delta: 160.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:49:05,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 527.49 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 233.2 MB in the beginning and 310.5 MB in the end (delta: -77.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:49:05,951 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.04 ms. Allocated memory is still 350.2 MB. Free memory was 310.5 MB in the beginning and 307.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:49:05,951 INFO L168 Benchmark]: Boogie Preprocessor took 62.69 ms. Allocated memory is still 350.2 MB. Free memory was 307.7 MB in the beginning and 305.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:49:05,958 INFO L168 Benchmark]: RCFGBuilder took 1896.21 ms. Allocated memory is still 350.2 MB. Free memory was 305.2 MB in the beginning and 247.5 MB in the end (delta: 57.7 MB). Peak memory consumption was 58.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:49:05,959 INFO L168 Benchmark]: TraceAbstraction took 23905.29 ms. Allocated memory was 350.2 MB in the beginning and 796.9 MB in the end (delta: 446.7 MB). Free memory was 247.5 MB in the beginning and 489.7 MB in the end (delta: -242.2 MB). Peak memory consumption was 205.5 MB. Max. memory is 16.0 GB. [2021-03-26 00:49:05,964 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.57 ms. Allocated memory is still 255.9 MB. Free memory was 237.7 MB in the beginning and 237.5 MB in the end (delta: 160.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 527.49 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 233.2 MB in the beginning and 310.5 MB in the end (delta: -77.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 78.04 ms. Allocated memory is still 350.2 MB. Free memory was 310.5 MB in the beginning and 307.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 62.69 ms. Allocated memory is still 350.2 MB. Free memory was 307.7 MB in the beginning and 305.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1896.21 ms. Allocated memory is still 350.2 MB. Free memory was 305.2 MB in the beginning and 247.5 MB in the end (delta: 57.7 MB). Peak memory consumption was 58.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 23905.29 ms. Allocated memory was 350.2 MB in the beginning and 796.9 MB in the end (delta: 446.7 MB). Free memory was 247.5 MB in the beginning and 489.7 MB in the end (delta: -242.2 MB). Peak memory consumption was 205.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8432.6ms, 101 PlacesBefore, 47 PlacesAfterwards, 93 TransitionsBefore, 38 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 6 FixpointIterations, 24 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 3269 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1829, positive: 1733, positive conditional: 1733, positive unconditional: 0, negative: 96, negative conditional: 96, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1330, positive: 1288, positive conditional: 0, positive unconditional: 1288, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1330, positive: 1288, positive conditional: 0, positive unconditional: 1288, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1330, positive: 1278, positive conditional: 0, positive unconditional: 1278, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 688, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 659, negative conditional: 0, negative unconditional: 659, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1829, positive: 445, positive conditional: 445, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 1330, unknown conditional: 1330, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 62, Positive conditional cache size: 62, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2679.4ms, 44 PlacesBefore, 33 PlacesAfterwards, 33 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 1218 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 303, positive: 216, positive conditional: 216, positive unconditional: 0, negative: 87, negative conditional: 87, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 34, positive conditional: 2, positive unconditional: 32, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, positive: 34, positive conditional: 2, positive unconditional: 32, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 206, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 177, negative conditional: 25, negative unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 303, positive: 182, positive conditional: 182, positive unconditional: 0, negative: 76, negative conditional: 76, negative unconditional: 0, unknown: 45, unknown conditional: 45, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 84, Positive conditional cache size: 84, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1101.9ms, 34 PlacesBefore, 32 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 792 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 120, positive: 66, positive conditional: 66, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, positive: 66, positive conditional: 66, positive unconditional: 0, negative: 53, negative conditional: 53, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 84, Positive conditional cache size: 84, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9ms, 34 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 214 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 14, negative conditional: 14, 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: 22, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 84, Positive conditional cache size: 84, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7ms, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 242 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 16, negative conditional: 16, 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: 26, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 84, Positive conditional cache size: 84, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.1ms, 38 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 192 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 8, positive conditional: 8, 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: 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: 20, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 84, Positive conditional cache size: 84, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.1ms, 40 PlacesBefore, 40 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 218 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 13, negative conditional: 13, 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: 4, 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: 6, positive: 6, positive conditional: 4, 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: 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: 25, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 90, Positive conditional cache size: 90, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 119.4ms, 43 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 84 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 6, positive conditional: 6, 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: 8, positive: 5, positive conditional: 2, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 2, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 95, Positive conditional cache size: 95, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 72.1ms, 46 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 24 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 1, 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: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 95, Positive conditional cache size: 95, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 111.9ms, 51 PlacesBefore, 51 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 27 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 1, negative conditional: 1, 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: 4, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 4, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 9, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 102, Positive conditional cache size: 102, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 108.6ms, 53 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 109 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 24, positive conditional: 24, 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: 16, positive: 15, positive conditional: 8, positive unconditional: 7, 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: 16, positive: 15, positive conditional: 8, positive unconditional: 7, 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: 16, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 117, Positive conditional cache size: 117, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 900.5ms, 56 PlacesBefore, 56 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 526 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 617 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 258, positive: 236, positive conditional: 236, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 28, positive unconditional: 9, 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: 37, positive: 37, positive conditional: 28, positive unconditional: 9, 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: 37, positive: 37, positive conditional: 0, positive unconditional: 37, 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: 258, positive: 199, positive conditional: 199, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 132, Positive conditional cache size: 132, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 139.2ms, 60 PlacesBefore, 60 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 656 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): 152, Positive cache size: 132, Positive conditional cache size: 132, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 88.8ms, 68 PlacesBefore, 68 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 698 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): 152, Positive cache size: 132, Positive conditional cache size: 132, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5114.1ms, 75 PlacesBefore, 70 PlacesAfterwards, 52 TransitionsBefore, 45 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 123 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 123, positive: 123, positive conditional: 123, 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: 86, positive: 86, positive conditional: 86, 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: 86, positive: 86, positive conditional: 86, 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: 86, positive: 86, positive conditional: 0, positive unconditional: 86, 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: 123, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 86, unknown conditional: 86, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 30, Positive conditional cache size: 30, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 777.9ms, 56 PlacesBefore, 53 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 10 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 10, 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: 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: 10, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 8, Positive conditional cache size: 8, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 23695.5ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2154.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8527.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 61 SDtfs, 33 SDslu, 20 SDs, 0 SdLazy, 350 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 500.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 446.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=519occurred in iteration=13, InterpolantAutomatonStates: 70, 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: 46.0ms SsaConstructionTime, 415.0ms SatisfiabilityAnalysisTime, 965.7ms InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 1325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...