/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/safe029_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-6f4246e9f5583d222ebb38ff8175c901f3a528f0-6f4246e [2021-04-29 00:35:13,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-29 00:35:13,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-29 00:35:13,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-29 00:35:13,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-29 00:35:13,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-29 00:35:13,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-29 00:35:13,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-29 00:35:13,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-29 00:35:13,269 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-29 00:35:13,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-29 00:35:13,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-29 00:35:13,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-29 00:35:13,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-29 00:35:13,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-29 00:35:13,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-29 00:35:13,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-29 00:35:13,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-29 00:35:13,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-29 00:35:13,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-29 00:35:13,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-29 00:35:13,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-29 00:35:13,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-29 00:35:13,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-29 00:35:13,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-29 00:35:13,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-29 00:35:13,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-29 00:35:13,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-29 00:35:13,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-29 00:35:13,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-29 00:35:13,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-29 00:35:13,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-29 00:35:13,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-29 00:35:13,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-29 00:35:13,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-29 00:35:13,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-29 00:35:13,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-29 00:35:13,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-29 00:35:13,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-29 00:35:13,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-29 00:35:13,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-29 00:35:13,309 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-04-29 00:35:13,351 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-29 00:35:13,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-29 00:35:13,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-29 00:35:13,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-29 00:35:13,356 INFO L138 SettingsManager]: * Use SBE=true [2021-04-29 00:35:13,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-29 00:35:13,358 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-29 00:35:13,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-29 00:35:13,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-29 00:35:13,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-29 00:35:13,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-29 00:35:13,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-29 00:35:13,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-29 00:35:13,361 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-29 00:35:13,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-29 00:35:13,362 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-29 00:35:13,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-29 00:35:13,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-29 00:35:13,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-29 00:35:13,363 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-29 00:35:13,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-29 00:35:13,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-29 00:35:13,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-29 00:35:13,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-29 00:35:13,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-29 00:35:13,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-29 00:35:13,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-29 00:35:13,365 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-04-29 00:35:13,366 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-04-29 00:35:13,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-29 00:35:13,366 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-04-29 00:35:13,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-29 00:35:13,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-29 00:35:13,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-29 00:35:13,878 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-29 00:35:13,879 INFO L275 PluginConnector]: CDTParser initialized [2021-04-29 00:35:13,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2021-04-29 00:35:13,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e99f5aac5/fcad2c9ce56f44af9cb18e3bff1efe39/FLAG83021c67f [2021-04-29 00:35:14,718 INFO L306 CDTParser]: Found 1 translation units. [2021-04-29 00:35:14,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2021-04-29 00:35:14,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e99f5aac5/fcad2c9ce56f44af9cb18e3bff1efe39/FLAG83021c67f [2021-04-29 00:35:15,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e99f5aac5/fcad2c9ce56f44af9cb18e3bff1efe39 [2021-04-29 00:35:15,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-29 00:35:15,047 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-29 00:35:15,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-29 00:35:15,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-29 00:35:15,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-29 00:35:15,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 12:35:15" (1/1) ... [2021-04-29 00:35:15,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2370a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:35:15, skipping insertion in model container [2021-04-29 00:35:15,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 12:35:15" (1/1) ... [2021-04-29 00:35:15,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-29 00:35:15,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-29 00:35:15,390 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/safe029_power.oepc.i[952,965] [2021-04-29 00:35:15,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-29 00:35:15,824 INFO L203 MainTranslator]: Completed pre-run [2021-04-29 00:35:15,844 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/safe029_power.oepc.i[952,965] [2021-04-29 00:35:15,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-29 00:35:16,088 INFO L208 MainTranslator]: Completed translation [2021-04-29 00:35:16,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:35:16 WrapperNode [2021-04-29 00:35:16,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-29 00:35:16,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-29 00:35:16,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-29 00:35:16,093 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-29 00:35:16,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:35:16" (1/1) ... [2021-04-29 00:35:16,149 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:35:16" (1/1) ... [2021-04-29 00:35:16,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-29 00:35:16,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-29 00:35:16,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-29 00:35:16,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-29 00:35:16,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:35:16" (1/1) ... [2021-04-29 00:35:16,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:35:16" (1/1) ... [2021-04-29 00:35:16,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:35:16" (1/1) ... [2021-04-29 00:35:16,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:35:16" (1/1) ... [2021-04-29 00:35:16,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:35:16" (1/1) ... [2021-04-29 00:35:16,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:35:16" (1/1) ... [2021-04-29 00:35:16,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:35:16" (1/1) ... [2021-04-29 00:35:16,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-29 00:35:16,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-29 00:35:16,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-29 00:35:16,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-29 00:35:16,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:35:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-29 00:35:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-29 00:35:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-29 00:35:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-29 00:35:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-29 00:35:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-29 00:35:16,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-29 00:35:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-29 00:35:16,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-29 00:35:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-29 00:35:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-29 00:35:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-29 00:35:16,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-29 00:35:16,385 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-29 00:35:18,442 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-29 00:35:18,443 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-29 00:35:18,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 12:35:18 BoogieIcfgContainer [2021-04-29 00:35:18,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-29 00:35:18,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-29 00:35:18,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-29 00:35:18,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-29 00:35:18,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 12:35:15" (1/3) ... [2021-04-29 00:35:18,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db52e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 12:35:18, skipping insertion in model container [2021-04-29 00:35:18,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:35:16" (2/3) ... [2021-04-29 00:35:18,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db52e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 12:35:18, skipping insertion in model container [2021-04-29 00:35:18,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 12:35:18" (3/3) ... [2021-04-29 00:35:18,454 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2021-04-29 00:35:18,461 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-29 00:35:18,467 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-29 00:35:18,468 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-29 00:35:18,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,502 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,503 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,503 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,503 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,504 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,504 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,504 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,505 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,510 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,510 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,510 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,519 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,522 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,523 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:35:18,526 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-29 00:35:18,548 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-04-29 00:35:18,573 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-29 00:35:18,573 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-29 00:35:18,573 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-29 00:35:18,574 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-29 00:35:18,574 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-29 00:35:18,574 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-29 00:35:18,574 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-29 00:35:18,574 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-29 00:35:18,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2021-04-29 00:35:18,626 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-04-29 00:35:18,626 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:35:18,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-04-29 00:35:18,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2021-04-29 00:35:18,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2021-04-29 00:35:18,637 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:35:18,653 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2021-04-29 00:35:18,657 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2021-04-29 00:35:18,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2021-04-29 00:35:18,679 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-04-29 00:35:18,679 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:35:18,680 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-04-29 00:35:18,683 INFO L146 LiptonReduction]: Number of co-enabled transitions 926 [2021-04-29 00:35:20,839 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-04-29 00:35:21,346 WARN L205 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-04-29 00:35:23,511 WARN L205 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-04-29 00:35:24,598 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 261 [2021-04-29 00:35:26,671 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-04-29 00:35:26,800 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:35:27,392 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-04-29 00:35:27,606 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-29 00:35:30,175 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-04-29 00:35:30,738 WARN L205 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-04-29 00:35:31,895 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 265 [2021-04-29 00:35:33,033 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 265 [2021-04-29 00:35:34,139 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-04-29 00:35:34,688 WARN L205 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-04-29 00:35:36,910 WARN L205 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 263 DAG size of output: 262 [2021-04-29 00:35:37,969 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 262 [2021-04-29 00:35:38,532 WARN L205 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-04-29 00:35:39,089 WARN L205 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-04-29 00:35:40,270 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 261 [2021-04-29 00:35:41,418 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 261 [2021-04-29 00:35:43,636 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 182 DAG size of output: 181 [2021-04-29 00:35:44,215 WARN L205 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2021-04-29 00:35:45,470 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 261 [2021-04-29 00:35:46,675 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 261 [2021-04-29 00:35:47,849 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 185 DAG size of output: 184 [2021-04-29 00:35:48,454 WARN L205 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-04-29 00:35:49,745 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 264 [2021-04-29 00:35:51,020 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 264 [2021-04-29 00:35:51,648 WARN L205 SmtUtils]: Spent 623.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-04-29 00:35:52,300 WARN L205 SmtUtils]: Spent 650.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-04-29 00:35:53,590 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 263 [2021-04-29 00:35:54,901 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 263 [2021-04-29 00:35:55,563 WARN L205 SmtUtils]: Spent 655.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-04-29 00:35:56,229 WARN L205 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-04-29 00:35:57,597 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 264 [2021-04-29 00:35:59,069 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 264 [2021-04-29 00:36:00,674 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-04-29 00:36:00,887 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-04-29 00:36:01,087 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2021-04-29 00:36:01,277 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2021-04-29 00:36:01,476 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2021-04-29 00:36:01,668 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2021-04-29 00:36:01,910 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2021-04-29 00:36:02,132 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2021-04-29 00:36:03,379 WARN L205 SmtUtils]: Spent 707.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-04-29 00:36:04,083 WARN L205 SmtUtils]: Spent 702.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-04-29 00:36:05,575 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 263 [2021-04-29 00:36:07,122 WARN L205 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 263 [2021-04-29 00:36:08,585 WARN L205 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 182 DAG size of output: 181 [2021-04-29 00:36:09,319 WARN L205 SmtUtils]: Spent 730.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2021-04-29 00:36:10,796 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 261 [2021-04-29 00:36:12,315 WARN L205 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 261 [2021-04-29 00:36:13,926 WARN L205 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 185 DAG size of output: 184 [2021-04-29 00:36:14,725 WARN L205 SmtUtils]: Spent 796.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-04-29 00:36:16,348 WARN L205 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 264 [2021-04-29 00:36:18,003 WARN L205 SmtUtils]: Spent 1.65 s on a formula simplification that was a NOOP. DAG size: 264 [2021-04-29 00:36:19,210 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2021-04-29 00:36:19,447 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2021-04-29 00:36:19,726 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-04-29 00:36:20,018 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-04-29 00:36:20,337 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2021-04-29 00:36:20,446 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:36:20,704 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2021-04-29 00:36:20,813 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:36:21,034 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-04-29 00:36:21,328 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-04-29 00:36:21,633 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-04-29 00:36:21,740 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:36:21,955 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-04-29 00:36:22,066 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:36:23,831 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2021-04-29 00:36:23,948 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:36:24,197 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2021-04-29 00:36:24,304 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:36:24,582 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-04-29 00:36:24,704 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:36:24,974 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-04-29 00:36:25,106 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:36:25,353 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2021-04-29 00:36:25,458 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:36:25,701 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2021-04-29 00:36:25,813 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:36:25,989 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-04-29 00:36:26,277 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-04-29 00:36:26,577 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-04-29 00:36:26,685 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:36:26,926 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-04-29 00:36:27,181 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2021-04-29 00:36:27,420 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2021-04-29 00:36:27,722 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:36:27,924 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:36:28,127 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:36:28,334 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:36:28,501 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:36:28,659 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:36:28,829 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:36:28,992 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:36:29,214 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:29,438 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:29,656 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:29,874 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:30,107 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:30,324 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:30,552 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:30,774 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:30,933 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:36:31,105 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:36:31,260 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:36:31,404 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:36:31,613 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:31,821 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:32,024 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:32,245 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:32,858 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2021-04-29 00:36:33,133 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-04-29 00:36:33,746 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2021-04-29 00:36:34,029 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-04-29 00:36:34,169 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:36:34,313 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:36:34,459 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:36:34,625 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:36:34,852 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:36:35,079 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:36:35,308 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:36:35,528 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:36:35,729 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:36:35,928 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:36:36,136 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:36:36,325 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:36:36,513 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:36:36,699 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:36:36,895 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:36:37,092 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:36:37,321 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:36:37,545 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:36:37,759 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:36:37,989 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:36:38,168 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:36:38,356 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:36:38,532 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:36:38,710 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:36:39,363 WARN L205 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-04-29 00:36:39,701 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-04-29 00:36:40,384 WARN L205 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-04-29 00:36:40,712 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-04-29 00:36:40,853 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:36:41,003 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:36:41,151 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:36:41,298 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:36:41,473 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:36:41,642 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:36:41,804 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:36:41,966 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:36:42,133 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:36:42,300 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:36:42,470 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:36:42,643 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:36:42,873 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:43,106 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:43,335 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:43,576 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:36:43,638 INFO L158 LiptonReduction]: Checked pairs total: 8042 [2021-04-29 00:36:43,638 INFO L160 LiptonReduction]: Total number of compositions: 172 [2021-04-29 00:36:43,645 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 85009 [2021-04-29 00:36:43,674 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-04-29 00:36:43,674 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:36:43,675 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:36:43,675 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-04-29 00:36:43,676 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:36:43,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:36:43,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1005452, now seen corresponding path program 1 times [2021-04-29 00:36:43,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:36:43,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237354897] [2021-04-29 00:36:43,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:36:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:36:43,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:43,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:36:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:36:43,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237354897] [2021-04-29 00:36:43,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:36:43,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:36:43,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814893523] [2021-04-29 00:36:43,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:36:43,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:36:44,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:36:44,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:36:44,013 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 251 [2021-04-29 00:36:44,018 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 98 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:44,018 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:36:44,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 251 [2021-04-29 00:36:44,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:36:44,464 INFO L129 PetriNetUnfolder]: 107/321 cut-off events. [2021-04-29 00:36:44,464 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:36:44,466 INFO L84 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 321 events. 107/321 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2092 event pairs, 76 based on Foata normal form. 6/149 useless extension candidates. Maximal degree in co-relation 482. Up to 157 conditions per place. [2021-04-29 00:36:44,468 INFO L132 encePairwiseOnDemand]: 235/251 looper letters, 7 selfloop transitions, 2 changer transitions 76/109 dead transitions. [2021-04-29 00:36:44,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 109 transitions, 312 flow [2021-04-29 00:36:44,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:36:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:36:44,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2021-04-29 00:36:44,491 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8061088977423638 [2021-04-29 00:36:44,492 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 607 transitions. [2021-04-29 00:36:44,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 607 transitions. [2021-04-29 00:36:44,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:36:44,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 607 transitions. [2021-04-29 00:36:44,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:44,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:44,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:44,526 INFO L185 Difference]: Start difference. First operand has 103 places, 98 transitions, 202 flow. Second operand 3 states and 607 transitions. [2021-04-29 00:36:44,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 109 transitions, 312 flow [2021-04-29 00:36:44,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 109 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:36:44,535 INFO L241 Difference]: Finished difference. Result has 100 places, 30 transitions, 68 flow [2021-04-29 00:36:44,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=100, PETRI_TRANSITIONS=30} [2021-04-29 00:36:44,539 INFO L343 CegarLoopForPetriNet]: 103 programPoint places, -3 predicate places. [2021-04-29 00:36:44,539 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:36:44,539 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 30 transitions, 68 flow [2021-04-29 00:36:44,540 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 30 transitions, 68 flow [2021-04-29 00:36:44,540 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2021-04-29 00:36:44,546 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-04-29 00:36:44,546 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:36:44,546 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 104 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-04-29 00:36:44,547 INFO L146 LiptonReduction]: Number of co-enabled transitions 462 [2021-04-29 00:36:45,162 INFO L158 LiptonReduction]: Checked pairs total: 414 [2021-04-29 00:36:45,163 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:36:45,163 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 624 [2021-04-29 00:36:45,165 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2021-04-29 00:36:45,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:45,166 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:36:45,166 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:36:45,166 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-29 00:36:45,167 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:36:45,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:36:45,167 INFO L82 PathProgramCache]: Analyzing trace with hash 907191905, now seen corresponding path program 1 times [2021-04-29 00:36:45,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:36:45,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516339748] [2021-04-29 00:36:45,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:36:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:36:45,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:45,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:36:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:36:45,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516339748] [2021-04-29 00:36:45,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:36:45,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:36:45,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294188564] [2021-04-29 00:36:45,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:36:45,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:36:45,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:36:45,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:36:45,403 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 251 [2021-04-29 00:36:45,404 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:45,404 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:36:45,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 251 [2021-04-29 00:36:45,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:36:45,434 INFO L129 PetriNetUnfolder]: 3/46 cut-off events. [2021-04-29 00:36:45,434 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:36:45,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 46 events. 3/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 151 event pairs, 1 based on Foata normal form. 1/29 useless extension candidates. Maximal degree in co-relation 56. Up to 10 conditions per place. [2021-04-29 00:36:45,435 INFO L132 encePairwiseOnDemand]: 247/251 looper letters, 3 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2021-04-29 00:36:45,435 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 84 flow [2021-04-29 00:36:45,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:36:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:36:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2021-04-29 00:36:45,441 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.702523240371846 [2021-04-29 00:36:45,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 529 transitions. [2021-04-29 00:36:45,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 529 transitions. [2021-04-29 00:36:45,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:36:45,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 529 transitions. [2021-04-29 00:36:45,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 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-04-29 00:36:45,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:45,449 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:45,449 INFO L185 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 3 states and 529 transitions. [2021-04-29 00:36:45,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 84 flow [2021-04-29 00:36:45,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:36:45,451 INFO L241 Difference]: Finished difference. Result has 38 places, 32 transitions, 83 flow [2021-04-29 00:36:45,451 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2021-04-29 00:36:45,452 INFO L343 CegarLoopForPetriNet]: 103 programPoint places, -65 predicate places. [2021-04-29 00:36:45,452 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:36:45,452 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 32 transitions, 83 flow [2021-04-29 00:36:45,453 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 32 transitions, 83 flow [2021-04-29 00:36:45,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 83 flow [2021-04-29 00:36:45,461 INFO L129 PetriNetUnfolder]: 3/44 cut-off events. [2021-04-29 00:36:45,461 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:36:45,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 44 events. 3/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 158 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 55. Up to 10 conditions per place. [2021-04-29 00:36:45,463 INFO L146 LiptonReduction]: Number of co-enabled transitions 500 [2021-04-29 00:36:45,561 INFO L158 LiptonReduction]: Checked pairs total: 368 [2021-04-29 00:36:45,561 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:36:45,562 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 110 [2021-04-29 00:36:45,563 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 83 flow [2021-04-29 00:36:45,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:45,564 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:36:45,564 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:36:45,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-29 00:36:45,565 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:36:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:36:45,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1941823633, now seen corresponding path program 1 times [2021-04-29 00:36:45,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:36:45,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057670173] [2021-04-29 00:36:45,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:36:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:36:45,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:45,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:36:45,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:45,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:36:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:36:45,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057670173] [2021-04-29 00:36:45,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:36:45,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:36:45,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917142550] [2021-04-29 00:36:45,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:36:45,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:36:45,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:36:45,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:36:45,764 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 251 [2021-04-29 00:36:45,765 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 83 flow. Second operand has 3 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-04-29 00:36:45,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:36:45,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 251 [2021-04-29 00:36:45,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:36:45,869 INFO L129 PetriNetUnfolder]: 32/117 cut-off events. [2021-04-29 00:36:45,870 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-04-29 00:36:45,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 117 events. 32/117 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 525 event pairs, 7 based on Foata normal form. 4/88 useless extension candidates. Maximal degree in co-relation 198. Up to 55 conditions per place. [2021-04-29 00:36:45,875 INFO L132 encePairwiseOnDemand]: 247/251 looper letters, 8 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2021-04-29 00:36:45,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 113 flow [2021-04-29 00:36:45,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:36:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:36:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2021-04-29 00:36:45,881 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6215139442231076 [2021-04-29 00:36:45,881 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2021-04-29 00:36:45,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2021-04-29 00:36:45,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:36:45,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2021-04-29 00:36:45,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:45,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:45,887 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:45,887 INFO L185 Difference]: Start difference. First operand has 38 places, 32 transitions, 83 flow. Second operand 3 states and 468 transitions. [2021-04-29 00:36:45,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 113 flow [2021-04-29 00:36:45,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-29 00:36:45,890 INFO L241 Difference]: Finished difference. Result has 40 places, 34 transitions, 99 flow [2021-04-29 00:36:45,890 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2021-04-29 00:36:45,891 INFO L343 CegarLoopForPetriNet]: 103 programPoint places, -63 predicate places. [2021-04-29 00:36:45,891 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:36:45,892 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 34 transitions, 99 flow [2021-04-29 00:36:45,893 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 34 transitions, 99 flow [2021-04-29 00:36:45,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 34 transitions, 99 flow [2021-04-29 00:36:45,904 INFO L129 PetriNetUnfolder]: 6/52 cut-off events. [2021-04-29 00:36:45,904 INFO L130 PetriNetUnfolder]: For 5/7 co-relation queries the response was YES. [2021-04-29 00:36:45,905 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 52 events. 6/52 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 197 event pairs, 2 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 78. Up to 13 conditions per place. [2021-04-29 00:36:45,906 INFO L146 LiptonReduction]: Number of co-enabled transitions 538 [2021-04-29 00:36:45,908 INFO L158 LiptonReduction]: Checked pairs total: 210 [2021-04-29 00:36:45,909 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:36:45,909 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-04-29 00:36:45,910 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 99 flow [2021-04-29 00:36:45,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 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-04-29 00:36:45,911 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:36:45,911 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:36:45,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-29 00:36:45,912 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:36:45,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:36:45,912 INFO L82 PathProgramCache]: Analyzing trace with hash -101098977, now seen corresponding path program 1 times [2021-04-29 00:36:45,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:36:45,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228345972] [2021-04-29 00:36:45,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:36:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:36:46,009 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-04-29 00:36:46,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-04-29 00:36:46,024 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-04-29 00:36:46,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-04-29 00:36:46,028 INFO L142 QuantifierPusher]: treesize reduction 16, result has 40.7 percent of original size [2021-04-29 00:36:46,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-29 00:36:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:36:46,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228345972] [2021-04-29 00:36:46,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:36:46,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-29 00:36:46,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338978040] [2021-04-29 00:36:46,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 00:36:46,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:36:46,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 00:36:46,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-04-29 00:36:46,053 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 251 [2021-04-29 00:36:46,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:46,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:36:46,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 251 [2021-04-29 00:36:46,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:36:46,172 INFO L129 PetriNetUnfolder]: 32/113 cut-off events. [2021-04-29 00:36:46,172 INFO L130 PetriNetUnfolder]: For 30/32 co-relation queries the response was YES. [2021-04-29 00:36:46,173 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 113 events. 32/113 cut-off events. For 30/32 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 488 event pairs, 13 based on Foata normal form. 1/83 useless extension candidates. Maximal degree in co-relation 225. Up to 50 conditions per place. [2021-04-29 00:36:46,174 INFO L132 encePairwiseOnDemand]: 245/251 looper letters, 10 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2021-04-29 00:36:46,174 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 152 flow [2021-04-29 00:36:46,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-29 00:36:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-29 00:36:46,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 619 transitions. [2021-04-29 00:36:46,181 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6165338645418327 [2021-04-29 00:36:46,181 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 619 transitions. [2021-04-29 00:36:46,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 619 transitions. [2021-04-29 00:36:46,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:36:46,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 619 transitions. [2021-04-29 00:36:46,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:46,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:46,189 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:46,189 INFO L185 Difference]: Start difference. First operand has 40 places, 34 transitions, 99 flow. Second operand 4 states and 619 transitions. [2021-04-29 00:36:46,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 152 flow [2021-04-29 00:36:46,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-29 00:36:46,192 INFO L241 Difference]: Finished difference. Result has 44 places, 38 transitions, 135 flow [2021-04-29 00:36:46,192 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2021-04-29 00:36:46,193 INFO L343 CegarLoopForPetriNet]: 103 programPoint places, -59 predicate places. [2021-04-29 00:36:46,193 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:36:46,193 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 135 flow [2021-04-29 00:36:46,193 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 135 flow [2021-04-29 00:36:46,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 135 flow [2021-04-29 00:36:46,212 INFO L129 PetriNetUnfolder]: 21/97 cut-off events. [2021-04-29 00:36:46,213 INFO L130 PetriNetUnfolder]: For 40/45 co-relation queries the response was YES. [2021-04-29 00:36:46,213 INFO L84 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 97 events. 21/97 cut-off events. For 40/45 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 443 event pairs, 5 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 187. Up to 27 conditions per place. [2021-04-29 00:36:46,215 INFO L146 LiptonReduction]: Number of co-enabled transitions 596 [2021-04-29 00:36:46,217 INFO L158 LiptonReduction]: Checked pairs total: 42 [2021-04-29 00:36:46,218 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:36:46,218 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-04-29 00:36:46,219 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 135 flow [2021-04-29 00:36:46,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:46,220 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:36:46,220 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:36:46,221 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-29 00:36:46,221 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:36:46,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:36:46,221 INFO L82 PathProgramCache]: Analyzing trace with hash -103151487, now seen corresponding path program 2 times [2021-04-29 00:36:46,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:36:46,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80646609] [2021-04-29 00:36:46,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:36:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:36:46,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:46,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:36:46,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:46,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:36:46,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:46,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:36:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:36:46,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80646609] [2021-04-29 00:36:46,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:36:46,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:36:46,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020474063] [2021-04-29 00:36:46,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:36:46,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:36:46,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:36:46,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:36:46,417 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 251 [2021-04-29 00:36:46,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:46,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:36:46,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 251 [2021-04-29 00:36:46,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:36:46,595 INFO L129 PetriNetUnfolder]: 34/112 cut-off events. [2021-04-29 00:36:46,596 INFO L130 PetriNetUnfolder]: For 72/76 co-relation queries the response was YES. [2021-04-29 00:36:46,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 112 events. 34/112 cut-off events. For 72/76 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 457 event pairs, 11 based on Foata normal form. 5/90 useless extension candidates. Maximal degree in co-relation 283. Up to 50 conditions per place. [2021-04-29 00:36:46,598 INFO L132 encePairwiseOnDemand]: 245/251 looper letters, 11 selfloop transitions, 9 changer transitions 0/45 dead transitions. [2021-04-29 00:36:46,598 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 208 flow [2021-04-29 00:36:46,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:36:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:36:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 738 transitions. [2021-04-29 00:36:46,605 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5880478087649402 [2021-04-29 00:36:46,605 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 738 transitions. [2021-04-29 00:36:46,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 738 transitions. [2021-04-29 00:36:46,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:36:46,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 738 transitions. [2021-04-29 00:36:46,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:46,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:46,614 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:46,615 INFO L185 Difference]: Start difference. First operand has 44 places, 38 transitions, 135 flow. Second operand 5 states and 738 transitions. [2021-04-29 00:36:46,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 208 flow [2021-04-29 00:36:46,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-29 00:36:46,618 INFO L241 Difference]: Finished difference. Result has 49 places, 42 transitions, 183 flow [2021-04-29 00:36:46,619 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2021-04-29 00:36:46,619 INFO L343 CegarLoopForPetriNet]: 103 programPoint places, -54 predicate places. [2021-04-29 00:36:46,619 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:36:46,619 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 42 transitions, 183 flow [2021-04-29 00:36:46,620 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 42 transitions, 183 flow [2021-04-29 00:36:46,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 42 transitions, 183 flow [2021-04-29 00:36:46,639 INFO L129 PetriNetUnfolder]: 22/99 cut-off events. [2021-04-29 00:36:46,639 INFO L130 PetriNetUnfolder]: For 144/149 co-relation queries the response was YES. [2021-04-29 00:36:46,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 99 events. 22/99 cut-off events. For 144/149 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 462 event pairs, 6 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 236. Up to 28 conditions per place. [2021-04-29 00:36:46,641 INFO L146 LiptonReduction]: Number of co-enabled transitions 638 [2021-04-29 00:36:46,644 INFO L158 LiptonReduction]: Checked pairs total: 46 [2021-04-29 00:36:46,645 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:36:46,645 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-04-29 00:36:46,646 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 183 flow [2021-04-29 00:36:46,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:46,647 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:36:46,647 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:36:46,647 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-29 00:36:46,648 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:36:46,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:36:46,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1081112426, now seen corresponding path program 1 times [2021-04-29 00:36:46,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:36:46,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919261519] [2021-04-29 00:36:46,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:36:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:36:46,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:46,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:36:46,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:46,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:36:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:36:46,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919261519] [2021-04-29 00:36:46,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:36:46,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-29 00:36:46,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960379333] [2021-04-29 00:36:46,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:36:46,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:36:46,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:36:46,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:36:46,733 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 251 [2021-04-29 00:36:46,735 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:46,735 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:36:46,735 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 251 [2021-04-29 00:36:46,735 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:36:46,792 INFO L129 PetriNetUnfolder]: 20/106 cut-off events. [2021-04-29 00:36:46,793 INFO L130 PetriNetUnfolder]: For 287/301 co-relation queries the response was YES. [2021-04-29 00:36:46,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 106 events. 20/106 cut-off events. For 287/301 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 520 event pairs, 10 based on Foata normal form. 7/80 useless extension candidates. Maximal degree in co-relation 261. Up to 35 conditions per place. [2021-04-29 00:36:46,794 INFO L132 encePairwiseOnDemand]: 248/251 looper letters, 3 selfloop transitions, 3 changer transitions 2/42 dead transitions. [2021-04-29 00:36:46,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 195 flow [2021-04-29 00:36:46,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:36:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:36:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2021-04-29 00:36:46,800 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.701195219123506 [2021-04-29 00:36:46,800 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2021-04-29 00:36:46,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2021-04-29 00:36:46,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:36:46,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2021-04-29 00:36:46,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:46,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:46,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:46,806 INFO L185 Difference]: Start difference. First operand has 49 places, 42 transitions, 183 flow. Second operand 3 states and 528 transitions. [2021-04-29 00:36:46,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 195 flow [2021-04-29 00:36:46,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 193 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-04-29 00:36:46,814 INFO L241 Difference]: Finished difference. Result has 52 places, 40 transitions, 185 flow [2021-04-29 00:36:46,814 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2021-04-29 00:36:46,815 INFO L343 CegarLoopForPetriNet]: 103 programPoint places, -51 predicate places. [2021-04-29 00:36:46,815 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:36:46,815 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 40 transitions, 185 flow [2021-04-29 00:36:46,815 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 40 transitions, 185 flow [2021-04-29 00:36:46,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 185 flow [2021-04-29 00:36:46,846 INFO L129 PetriNetUnfolder]: 20/114 cut-off events. [2021-04-29 00:36:46,847 INFO L130 PetriNetUnfolder]: For 199/207 co-relation queries the response was YES. [2021-04-29 00:36:46,848 INFO L84 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 114 events. 20/114 cut-off events. For 199/207 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 607 event pairs, 8 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 271. Up to 33 conditions per place. [2021-04-29 00:36:46,849 INFO L146 LiptonReduction]: Number of co-enabled transitions 578 [2021-04-29 00:36:46,853 INFO L158 LiptonReduction]: Checked pairs total: 42 [2021-04-29 00:36:46,853 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:36:46,854 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-04-29 00:36:46,856 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 185 flow [2021-04-29 00:36:46,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:46,857 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:36:46,857 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:36:46,857 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-29 00:36:46,857 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:36:46,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:36:46,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2076765241, now seen corresponding path program 1 times [2021-04-29 00:36:46,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:36:46,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875969442] [2021-04-29 00:36:46,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:36:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:36:46,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:46,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:36:46,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:46,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:36:46,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:46,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:36:47,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:47,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:36:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:36:47,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875969442] [2021-04-29 00:36:47,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:36:47,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:36:47,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075809195] [2021-04-29 00:36:47,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:36:47,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:36:47,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:36:47,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:36:47,043 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 251 [2021-04-29 00:36:47,044 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:47,044 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:36:47,044 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 251 [2021-04-29 00:36:47,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:36:47,183 INFO L129 PetriNetUnfolder]: 33/154 cut-off events. [2021-04-29 00:36:47,184 INFO L130 PetriNetUnfolder]: For 255/262 co-relation queries the response was YES. [2021-04-29 00:36:47,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 154 events. 33/154 cut-off events. For 255/262 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 879 event pairs, 11 based on Foata normal form. 3/111 useless extension candidates. Maximal degree in co-relation 413. Up to 56 conditions per place. [2021-04-29 00:36:47,186 INFO L132 encePairwiseOnDemand]: 246/251 looper letters, 10 selfloop transitions, 9 changer transitions 0/43 dead transitions. [2021-04-29 00:36:47,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 239 flow [2021-04-29 00:36:47,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-29 00:36:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-29 00:36:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2021-04-29 00:36:47,193 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6175298804780877 [2021-04-29 00:36:47,193 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 620 transitions. [2021-04-29 00:36:47,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 620 transitions. [2021-04-29 00:36:47,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:36:47,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 620 transitions. [2021-04-29 00:36:47,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:47,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:47,200 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:47,200 INFO L185 Difference]: Start difference. First operand has 51 places, 40 transitions, 185 flow. Second operand 4 states and 620 transitions. [2021-04-29 00:36:47,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 239 flow [2021-04-29 00:36:47,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 43 transitions, 234 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-04-29 00:36:47,204 INFO L241 Difference]: Finished difference. Result has 54 places, 42 transitions, 224 flow [2021-04-29 00:36:47,205 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2021-04-29 00:36:47,205 INFO L343 CegarLoopForPetriNet]: 103 programPoint places, -49 predicate places. [2021-04-29 00:36:47,205 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:36:47,205 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 42 transitions, 224 flow [2021-04-29 00:36:47,206 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 42 transitions, 224 flow [2021-04-29 00:36:47,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 42 transitions, 224 flow [2021-04-29 00:36:47,228 INFO L129 PetriNetUnfolder]: 20/112 cut-off events. [2021-04-29 00:36:47,228 INFO L130 PetriNetUnfolder]: For 224/229 co-relation queries the response was YES. [2021-04-29 00:36:47,229 INFO L84 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 112 events. 20/112 cut-off events. For 224/229 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 574 event pairs, 5 based on Foata normal form. 2/75 useless extension candidates. Maximal degree in co-relation 310. Up to 33 conditions per place. [2021-04-29 00:36:47,232 INFO L146 LiptonReduction]: Number of co-enabled transitions 624 [2021-04-29 00:36:47,235 INFO L158 LiptonReduction]: Checked pairs total: 46 [2021-04-29 00:36:47,235 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:36:47,235 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-04-29 00:36:47,236 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 224 flow [2021-04-29 00:36:47,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:47,237 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:36:47,237 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:36:47,237 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-29 00:36:47,237 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:36:47,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:36:47,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1095245872, now seen corresponding path program 1 times [2021-04-29 00:36:47,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:36:47,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713518363] [2021-04-29 00:36:47,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:36:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:36:47,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:47,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:36:47,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:47,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:36:47,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:47,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-29 00:36:47,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:47,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-29 00:36:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:36:47,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713518363] [2021-04-29 00:36:47,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:36:47,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:36:47,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341912038] [2021-04-29 00:36:47,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:36:47,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:36:47,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:36:47,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:36:47,399 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 251 [2021-04-29 00:36:47,400 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:47,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:36:47,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 251 [2021-04-29 00:36:47,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:36:47,564 INFO L129 PetriNetUnfolder]: 32/152 cut-off events. [2021-04-29 00:36:47,564 INFO L130 PetriNetUnfolder]: For 300/313 co-relation queries the response was YES. [2021-04-29 00:36:47,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 152 events. 32/152 cut-off events. For 300/313 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 858 event pairs, 2 based on Foata normal form. 5/112 useless extension candidates. Maximal degree in co-relation 460. Up to 66 conditions per place. [2021-04-29 00:36:47,566 INFO L132 encePairwiseOnDemand]: 245/251 looper letters, 12 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2021-04-29 00:36:47,566 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 43 transitions, 266 flow [2021-04-29 00:36:47,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-29 00:36:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-29 00:36:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 590 transitions. [2021-04-29 00:36:47,573 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5876494023904383 [2021-04-29 00:36:47,573 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 590 transitions. [2021-04-29 00:36:47,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 590 transitions. [2021-04-29 00:36:47,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:36:47,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 590 transitions. [2021-04-29 00:36:47,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.5) internal successors, (590), 4 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:47,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:47,580 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:47,580 INFO L185 Difference]: Start difference. First operand has 54 places, 42 transitions, 224 flow. Second operand 4 states and 590 transitions. [2021-04-29 00:36:47,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 43 transitions, 266 flow [2021-04-29 00:36:47,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 243 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-04-29 00:36:47,584 INFO L241 Difference]: Finished difference. Result has 55 places, 42 transitions, 223 flow [2021-04-29 00:36:47,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2021-04-29 00:36:47,585 INFO L343 CegarLoopForPetriNet]: 103 programPoint places, -48 predicate places. [2021-04-29 00:36:47,585 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:36:47,585 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 223 flow [2021-04-29 00:36:47,585 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 223 flow [2021-04-29 00:36:47,586 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 42 transitions, 223 flow [2021-04-29 00:36:47,642 INFO L129 PetriNetUnfolder]: 20/114 cut-off events. [2021-04-29 00:36:47,643 INFO L130 PetriNetUnfolder]: For 185/193 co-relation queries the response was YES. [2021-04-29 00:36:47,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 114 events. 20/114 cut-off events. For 185/193 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 578 event pairs, 3 based on Foata normal form. 3/75 useless extension candidates. Maximal degree in co-relation 300. Up to 34 conditions per place. [2021-04-29 00:36:47,646 INFO L146 LiptonReduction]: Number of co-enabled transitions 620 [2021-04-29 00:36:47,650 INFO L158 LiptonReduction]: Checked pairs total: 46 [2021-04-29 00:36:47,650 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:36:47,650 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 65 [2021-04-29 00:36:47,652 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 223 flow [2021-04-29 00:36:47,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:47,652 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:36:47,653 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:36:47,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-29 00:36:47,653 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:36:47,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:36:47,653 INFO L82 PathProgramCache]: Analyzing trace with hash 36503238, now seen corresponding path program 1 times [2021-04-29 00:36:47,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:36:47,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268285787] [2021-04-29 00:36:47,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:36:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:36:47,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:47,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:36:47,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:47,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:36:47,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:47,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:36:47,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:36:47,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268285787] [2021-04-29 00:36:47,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:36:47,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:36:47,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063748194] [2021-04-29 00:36:47,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 00:36:47,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:36:47,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 00:36:47,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-29 00:36:47,750 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 251 [2021-04-29 00:36:47,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:47,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:36:47,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 251 [2021-04-29 00:36:47,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:36:48,103 INFO L129 PetriNetUnfolder]: 561/1362 cut-off events. [2021-04-29 00:36:48,104 INFO L130 PetriNetUnfolder]: For 337/823 co-relation queries the response was YES. [2021-04-29 00:36:48,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2973 conditions, 1362 events. 561/1362 cut-off events. For 337/823 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 11985 event pairs, 153 based on Foata normal form. 63/366 useless extension candidates. Maximal degree in co-relation 2951. Up to 811 conditions per place. [2021-04-29 00:36:48,113 INFO L132 encePairwiseOnDemand]: 237/251 looper letters, 16 selfloop transitions, 21 changer transitions 7/65 dead transitions. [2021-04-29 00:36:48,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 334 flow [2021-04-29 00:36:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:36:48,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:36:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 862 transitions. [2021-04-29 00:36:48,119 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6868525896414343 [2021-04-29 00:36:48,119 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 862 transitions. [2021-04-29 00:36:48,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 862 transitions. [2021-04-29 00:36:48,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:36:48,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 862 transitions. [2021-04-29 00:36:48,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.4) internal successors, (862), 5 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:48,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:48,129 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:48,129 INFO L185 Difference]: Start difference. First operand has 55 places, 42 transitions, 223 flow. Second operand 5 states and 862 transitions. [2021-04-29 00:36:48,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 334 flow [2021-04-29 00:36:48,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 315 flow, removed 1 selfloop flow, removed 5 redundant places. [2021-04-29 00:36:48,135 INFO L241 Difference]: Finished difference. Result has 57 places, 57 transitions, 319 flow [2021-04-29 00:36:48,135 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2021-04-29 00:36:48,136 INFO L343 CegarLoopForPetriNet]: 103 programPoint places, -46 predicate places. [2021-04-29 00:36:48,136 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:36:48,136 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 57 transitions, 319 flow [2021-04-29 00:36:48,136 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 57 transitions, 319 flow [2021-04-29 00:36:48,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 57 transitions, 319 flow [2021-04-29 00:36:48,224 INFO L129 PetriNetUnfolder]: 72/619 cut-off events. [2021-04-29 00:36:48,224 INFO L130 PetriNetUnfolder]: For 471/500 co-relation queries the response was YES. [2021-04-29 00:36:48,228 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 619 events. 72/619 cut-off events. For 471/500 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 6959 event pairs, 3 based on Foata normal form. 11/222 useless extension candidates. Maximal degree in co-relation 1685. Up to 234 conditions per place. [2021-04-29 00:36:48,235 INFO L146 LiptonReduction]: Number of co-enabled transitions 684 [2021-04-29 00:36:48,240 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:36:48,241 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:36:48,241 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 105 [2021-04-29 00:36:48,242 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 319 flow [2021-04-29 00:36:48,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:48,242 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:36:48,242 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:36:48,243 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-29 00:36:48,243 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:36:48,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:36:48,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1410347295, now seen corresponding path program 1 times [2021-04-29 00:36:48,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:36:48,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432384139] [2021-04-29 00:36:48,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:36:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:36:48,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:48,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:36:48,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:48,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:36:48,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:48,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:36:48,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:48,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:36:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:36:48,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432384139] [2021-04-29 00:36:48,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:36:48,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:36:48,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233398883] [2021-04-29 00:36:48,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:36:48,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:36:48,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:36:48,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:36:48,353 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 251 [2021-04-29 00:36:48,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:48,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:36:48,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 251 [2021-04-29 00:36:48,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:36:48,787 INFO L129 PetriNetUnfolder]: 216/926 cut-off events. [2021-04-29 00:36:48,787 INFO L130 PetriNetUnfolder]: For 886/2953 co-relation queries the response was YES. [2021-04-29 00:36:48,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3055 conditions, 926 events. 216/926 cut-off events. For 886/2953 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 9683 event pairs, 0 based on Foata normal form. 84/340 useless extension candidates. Maximal degree in co-relation 3031. Up to 337 conditions per place. [2021-04-29 00:36:48,795 INFO L132 encePairwiseOnDemand]: 237/251 looper letters, 4 selfloop transitions, 33 changer transitions 20/72 dead transitions. [2021-04-29 00:36:48,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 478 flow [2021-04-29 00:36:48,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:36:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:36:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1196 transitions. [2021-04-29 00:36:48,802 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6807057484348321 [2021-04-29 00:36:48,803 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1196 transitions. [2021-04-29 00:36:48,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1196 transitions. [2021-04-29 00:36:48,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:36:48,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1196 transitions. [2021-04-29 00:36:48,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 170.85714285714286) internal successors, (1196), 7 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:48,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:48,814 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:48,814 INFO L185 Difference]: Start difference. First operand has 56 places, 57 transitions, 319 flow. Second operand 7 states and 1196 transitions. [2021-04-29 00:36:48,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 478 flow [2021-04-29 00:36:48,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 72 transitions, 464 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-04-29 00:36:48,823 INFO L241 Difference]: Finished difference. Result has 64 places, 51 transitions, 368 flow [2021-04-29 00:36:48,823 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2021-04-29 00:36:48,824 INFO L343 CegarLoopForPetriNet]: 103 programPoint places, -39 predicate places. [2021-04-29 00:36:48,824 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:36:48,824 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 51 transitions, 368 flow [2021-04-29 00:36:48,824 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 51 transitions, 368 flow [2021-04-29 00:36:48,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 51 transitions, 368 flow [2021-04-29 00:36:48,866 INFO L129 PetriNetUnfolder]: 23/249 cut-off events. [2021-04-29 00:36:48,867 INFO L130 PetriNetUnfolder]: For 663/832 co-relation queries the response was YES. [2021-04-29 00:36:48,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 249 events. 23/249 cut-off events. For 663/832 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 2247 event pairs, 0 based on Foata normal form. 1/83 useless extension candidates. Maximal degree in co-relation 960. Up to 168 conditions per place. [2021-04-29 00:36:48,873 INFO L146 LiptonReduction]: Number of co-enabled transitions 384 [2021-04-29 00:36:48,879 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:36:48,879 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:36:48,880 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-04-29 00:36:48,881 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 368 flow [2021-04-29 00:36:48,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:48,882 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:36:48,882 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:36:48,882 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-29 00:36:48,882 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:36:48,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:36:48,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1337803954, now seen corresponding path program 1 times [2021-04-29 00:36:48,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:36:48,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867363041] [2021-04-29 00:36:48,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:36:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:36:48,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:48,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:36:48,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:48,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-04-29 00:36:49,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:49,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-04-29 00:36:49,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:49,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-04-29 00:36:49,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:36:49,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-29 00:36:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:36:49,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867363041] [2021-04-29 00:36:49,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:36:49,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:36:49,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679675419] [2021-04-29 00:36:49,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:36:49,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:36:49,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:36:49,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:36:49,141 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 251 [2021-04-29 00:36:49,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 139.16666666666666) internal successors, (835), 6 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:49,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:36:49,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 251 [2021-04-29 00:36:49,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:36:49,328 INFO L129 PetriNetUnfolder]: 34/330 cut-off events. [2021-04-29 00:36:49,329 INFO L130 PetriNetUnfolder]: For 1074/1368 co-relation queries the response was YES. [2021-04-29 00:36:49,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 330 events. 34/330 cut-off events. For 1074/1368 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 3016 event pairs, 0 based on Foata normal form. 16/126 useless extension candidates. Maximal degree in co-relation 1329. Up to 210 conditions per place. [2021-04-29 00:36:49,331 INFO L132 encePairwiseOnDemand]: 246/251 looper letters, 4 selfloop transitions, 5 changer transitions 6/52 dead transitions. [2021-04-29 00:36:49,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 52 transitions, 404 flow [2021-04-29 00:36:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:36:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:36:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2021-04-29 00:36:49,339 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5585657370517928 [2021-04-29 00:36:49,339 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 701 transitions. [2021-04-29 00:36:49,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 701 transitions. [2021-04-29 00:36:49,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:36:49,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 701 transitions. [2021-04-29 00:36:49,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:49,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:49,350 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:49,350 INFO L185 Difference]: Start difference. First operand has 60 places, 51 transitions, 368 flow. Second operand 5 states and 701 transitions. [2021-04-29 00:36:49,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 52 transitions, 404 flow [2021-04-29 00:36:49,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 297 flow, removed 23 selfloop flow, removed 13 redundant places. [2021-04-29 00:36:49,361 INFO L241 Difference]: Finished difference. Result has 52 places, 46 transitions, 249 flow [2021-04-29 00:36:49,362 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2021-04-29 00:36:49,362 INFO L343 CegarLoopForPetriNet]: 103 programPoint places, -51 predicate places. [2021-04-29 00:36:49,362 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:36:49,362 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 46 transitions, 249 flow [2021-04-29 00:36:49,363 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 249 flow [2021-04-29 00:36:49,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 249 flow [2021-04-29 00:36:49,389 INFO L129 PetriNetUnfolder]: 13/159 cut-off events. [2021-04-29 00:36:49,389 INFO L130 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2021-04-29 00:36:49,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 159 events. 13/159 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 1245 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 475. Up to 91 conditions per place. [2021-04-29 00:36:49,392 INFO L146 LiptonReduction]: Number of co-enabled transitions 246 [2021-04-29 00:36:49,758 INFO L158 LiptonReduction]: Checked pairs total: 20 [2021-04-29 00:36:49,758 INFO L160 LiptonReduction]: Total number of compositions: 2 [2021-04-29 00:36:49,758 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 396 [2021-04-29 00:36:49,759 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 252 flow [2021-04-29 00:36:49,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 139.16666666666666) internal successors, (835), 6 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:36:49,760 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:36:49,760 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:36:49,760 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-29 00:36:49,761 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:36:49,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:36:49,761 INFO L82 PathProgramCache]: Analyzing trace with hash -89136878, now seen corresponding path program 1 times [2021-04-29 00:36:49,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:36:49,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818347387] [2021-04-29 00:36:49,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:36:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 00:36:49,841 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 00:36:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 00:36:49,943 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 00:36:50,006 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-29 00:36:50,007 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-29 00:36:50,008 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-29 00:36:50,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 12:36:50 BasicIcfg [2021-04-29 00:36:50,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-29 00:36:50,148 INFO L168 Benchmark]: Toolchain (without parser) took 95136.80 ms. Allocated memory was 306.2 MB in the beginning and 616.6 MB in the end (delta: 310.4 MB). Free memory was 279.7 MB in the beginning and 224.9 MB in the end (delta: 54.8 MB). Peak memory consumption was 368.9 MB. Max. memory is 16.0 GB. [2021-04-29 00:36:50,148 INFO L168 Benchmark]: CDTParser took 0.72 ms. Allocated memory is still 306.2 MB. Free memory was 277.3 MB in the beginning and 277.2 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-29 00:36:50,149 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1041.84 ms. Allocated memory is still 306.2 MB. Free memory was 276.6 MB in the beginning and 273.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 16.0 GB. [2021-04-29 00:36:50,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.56 ms. Allocated memory is still 306.2 MB. Free memory was 273.8 MB in the beginning and 270.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-04-29 00:36:50,149 INFO L168 Benchmark]: Boogie Preprocessor took 60.51 ms. Allocated memory is still 306.2 MB. Free memory was 270.7 MB in the beginning and 268.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:36:50,150 INFO L168 Benchmark]: RCFGBuilder took 2170.82 ms. Allocated memory is still 306.2 MB. Free memory was 268.6 MB in the beginning and 241.4 MB in the end (delta: 27.2 MB). Peak memory consumption was 163.6 MB. Max. memory is 16.0 GB. [2021-04-29 00:36:50,150 INFO L168 Benchmark]: TraceAbstraction took 91699.80 ms. Allocated memory was 306.2 MB in the beginning and 616.6 MB in the end (delta: 310.4 MB). Free memory was 241.4 MB in the beginning and 224.9 MB in the end (delta: 16.5 MB). Peak memory consumption was 327.9 MB. Max. memory is 16.0 GB. [2021-04-29 00:36:50,152 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.72 ms. Allocated memory is still 306.2 MB. Free memory was 277.3 MB in the beginning and 277.2 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 1041.84 ms. Allocated memory is still 306.2 MB. Free memory was 276.6 MB in the beginning and 273.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 120.56 ms. Allocated memory is still 306.2 MB. Free memory was 273.8 MB in the beginning and 270.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 60.51 ms. Allocated memory is still 306.2 MB. Free memory was 270.7 MB in the beginning and 268.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2170.82 ms. Allocated memory is still 306.2 MB. Free memory was 268.6 MB in the beginning and 241.4 MB in the end (delta: 27.2 MB). Peak memory consumption was 163.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 91699.80 ms. Allocated memory was 306.2 MB in the beginning and 616.6 MB in the end (delta: 310.4 MB). Free memory was 241.4 MB in the beginning and 224.9 MB in the end (delta: 16.5 MB). Peak memory consumption was 327.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 84980.6ms, 82 PlacesBefore, 103 PlacesAfterwards, 77 TransitionsBefore, 98 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 8 FixpointIterations, 104 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 172 TotalNumberOfCompositions, 8042 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2469, positive: 2284, positive conditional: 2284, positive unconditional: 0, negative: 185, negative conditional: 185, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1203, positive: 1153, positive conditional: 0, positive unconditional: 1153, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1203, positive: 1153, positive conditional: 0, positive unconditional: 1153, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1203, positive: 1135, positive conditional: 0, positive unconditional: 1135, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1777, positive: 128, positive conditional: 0, positive unconditional: 128, negative: 1649, negative conditional: 0, negative unconditional: 1649, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2469, positive: 1131, positive conditional: 1131, positive unconditional: 0, negative: 135, negative conditional: 135, negative unconditional: 0, unknown: 1203, unknown conditional: 1203, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1203, Positive cache size: 1153, Positive conditional cache size: 1153, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 622.9ms, 100 PlacesBefore, 37 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 414 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 61, positive: 39, positive conditional: 39, 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: 22, positive conditional: 0, positive unconditional: 22, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 609, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 587, negative conditional: 0, negative unconditional: 587, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1240, Positive cache size: 1175, Positive conditional cache size: 1175, Positive unconditional cache size: 0, Negative cache size: 65, Negative conditional cache size: 65, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 108.6ms, 38 PlacesBefore, 38 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 368 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 80, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 24, positive conditional: 3, positive unconditional: 21, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 24, positive conditional: 3, positive unconditional: 21, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1268, Positive cache size: 1199, Positive conditional cache size: 1199, Positive unconditional cache size: 0, Negative cache size: 69, Negative conditional cache size: 69, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.5ms, 40 PlacesBefore, 40 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 210 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 34, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1269, Positive cache size: 1200, Positive conditional cache size: 1200, Positive unconditional cache size: 0, Negative cache size: 69, Negative conditional cache size: 69, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.3ms, 44 PlacesBefore, 44 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 596 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 42 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1272, Positive cache size: 1203, Positive conditional cache size: 1203, Positive unconditional cache size: 0, Negative cache size: 69, Negative conditional cache size: 69, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.0ms, 49 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 638 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 46 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1274, Positive cache size: 1205, Positive conditional cache size: 1205, Positive unconditional cache size: 0, Negative cache size: 69, Negative conditional cache size: 69, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.2ms, 52 PlacesBefore, 51 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 42 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1276, Positive cache size: 1207, Positive conditional cache size: 1207, Positive unconditional cache size: 0, Negative cache size: 69, Negative conditional cache size: 69, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.4ms, 54 PlacesBefore, 54 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 624 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 46 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1279, Positive cache size: 1210, Positive conditional cache size: 1210, Positive unconditional cache size: 0, Negative cache size: 69, Negative conditional cache size: 69, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 64.7ms, 55 PlacesBefore, 55 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 46 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 3, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 3, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1283, Positive cache size: 1214, Positive conditional cache size: 1214, Positive unconditional cache size: 0, Negative cache size: 69, Negative conditional cache size: 69, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 104.3ms, 57 PlacesBefore, 56 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 684 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): 1283, Positive cache size: 1214, Positive conditional cache size: 1214, Positive unconditional cache size: 0, Negative cache size: 69, Negative conditional cache size: 69, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.1ms, 64 PlacesBefore, 60 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 384 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): 1283, Positive cache size: 1214, Positive conditional cache size: 1214, Positive unconditional cache size: 0, Negative cache size: 69, Negative conditional cache size: 69, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 395.1ms, 52 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 20 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 20, 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: 16, positive: 16, positive conditional: 16, 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: 16, positive: 16, positive conditional: 16, 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: 16, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1299, Positive cache size: 1230, Positive conditional cache size: 1230, Positive unconditional cache size: 0, Negative cache size: 69, Negative conditional cache size: 69, 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: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2474; [L793] FCALL, FORK 0 pthread_create(&t2474, ((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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 14.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 91440.4ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2587.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 85085.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 52 SDtfs, 35 SDslu, 9 SDs, 0 SdLazy, 275 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 795.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 534.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=10, InterpolantAutomatonStates: 46, 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: 51.5ms SsaConstructionTime, 488.3ms SatisfiabilityAnalysisTime, 1249.2ms InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 666 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...