/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 15:42:16,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 15:42:16,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 15:42:16,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 15:42:16,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 15:42:16,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 15:42:16,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 15:42:16,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 15:42:16,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 15:42:16,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 15:42:16,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 15:42:16,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 15:42:16,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 15:42:16,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 15:42:16,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 15:42:16,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 15:42:16,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 15:42:16,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 15:42:16,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 15:42:16,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 15:42:16,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 15:42:16,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 15:42:16,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 15:42:16,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 15:42:16,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 15:42:16,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 15:42:16,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 15:42:16,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 15:42:16,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 15:42:16,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 15:42:16,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 15:42:16,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 15:42:16,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 15:42:16,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 15:42:16,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 15:42:16,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 15:42:16,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 15:42:16,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 15:42:16,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 15:42:16,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 15:42:16,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 15:42:16,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 15:42:16,451 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 15:42:16,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 15:42:16,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 15:42:16,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 15:42:16,454 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 15:42:16,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 15:42:16,454 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 15:42:16,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 15:42:16,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 15:42:16,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 15:42:16,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 15:42:16,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 15:42:16,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 15:42:16,456 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 15:42:16,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 15:42:16,456 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 15:42:16,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 15:42:16,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 15:42:16,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 15:42:16,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 15:42:16,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 15:42:16,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:42:16,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 15:42:16,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 15:42:16,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 15:42:16,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 15:42:16,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 15:42:16,458 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 15:42:16,458 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 15:42:16,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 15:42:16,458 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-11 15:42:16,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 15:42:16,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 15:42:16,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 15:42:16,774 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 15:42:16,775 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 15:42:16,776 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt.i [2021-06-11 15:42:16,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a1ba227/41d287a92fb04afc88e004272341da20/FLAGdaa6e5640 [2021-06-11 15:42:17,299 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 15:42:17,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt.i [2021-06-11 15:42:17,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a1ba227/41d287a92fb04afc88e004272341da20/FLAGdaa6e5640 [2021-06-11 15:42:17,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a1ba227/41d287a92fb04afc88e004272341da20 [2021-06-11 15:42:17,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 15:42:17,656 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 15:42:17,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 15:42:17,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 15:42:17,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 15:42:17,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:42:17" (1/1) ... [2021-06-11 15:42:17,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5bfd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:42:17, skipping insertion in model container [2021-06-11 15:42:17,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:42:17" (1/1) ... [2021-06-11 15:42:17,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 15:42:17,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 15:42:17,859 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/mix029_power.opt.i[950,963] [2021-06-11 15:42:18,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:42:18,110 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 15:42:18,121 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/mix029_power.opt.i[950,963] [2021-06-11 15:42:18,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:42:18,229 INFO L208 MainTranslator]: Completed translation [2021-06-11 15:42:18,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:42:18 WrapperNode [2021-06-11 15:42:18,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 15:42:18,232 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 15:42:18,232 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 15:42:18,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 15:42:18,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:42:18" (1/1) ... [2021-06-11 15:42:18,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:42:18" (1/1) ... [2021-06-11 15:42:18,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 15:42:18,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 15:42:18,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 15:42:18,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 15:42:18,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:42:18" (1/1) ... [2021-06-11 15:42:18,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:42:18" (1/1) ... [2021-06-11 15:42:18,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:42:18" (1/1) ... [2021-06-11 15:42:18,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:42:18" (1/1) ... [2021-06-11 15:42:18,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:42:18" (1/1) ... [2021-06-11 15:42:18,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:42:18" (1/1) ... [2021-06-11 15:42:18,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:42:18" (1/1) ... [2021-06-11 15:42:18,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 15:42:18,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 15:42:18,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 15:42:18,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 15:42:18,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:42:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:42:18,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 15:42:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 15:42:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 15:42:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 15:42:18,463 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 15:42:18,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 15:42:18,464 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 15:42:18,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 15:42:18,464 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 15:42:18,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 15:42:18,464 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-11 15:42:18,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-11 15:42:18,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 15:42:18,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 15:42:18,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 15:42:18,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 15:42:18,466 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 15:42:20,282 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 15:42:20,282 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 15:42:20,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:42:20 BoogieIcfgContainer [2021-06-11 15:42:20,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 15:42:20,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 15:42:20,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 15:42:20,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 15:42:20,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 03:42:17" (1/3) ... [2021-06-11 15:42:20,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259b73f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:42:20, skipping insertion in model container [2021-06-11 15:42:20,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:42:18" (2/3) ... [2021-06-11 15:42:20,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259b73f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:42:20, skipping insertion in model container [2021-06-11 15:42:20,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:42:20" (3/3) ... [2021-06-11 15:42:20,291 INFO L111 eAbstractionObserver]: Analyzing ICFG mix029_power.opt.i [2021-06-11 15:42:20,298 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 15:42:20,302 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 15:42:20,302 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 15:42:20,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,340 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,340 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,340 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,340 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,342 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,342 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,342 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,342 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,347 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,347 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,347 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,347 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,347 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,348 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,348 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,348 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,352 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,352 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,353 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,353 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,363 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,370 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,370 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,373 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,374 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,375 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,376 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,377 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,377 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:42:20,379 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 15:42:20,395 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-11 15:42:20,425 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 15:42:20,425 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 15:42:20,425 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 15:42:20,426 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 15:42:20,426 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 15:42:20,426 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 15:42:20,426 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 15:42:20,426 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 15:42:20,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2021-06-11 15:42:20,486 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-06-11 15:42:20,486 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:42:20,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-06-11 15:42:20,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 116 transitions, 252 flow [2021-06-11 15:42:20,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 112 transitions, 236 flow [2021-06-11 15:42:20,503 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:20,514 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 236 flow [2021-06-11 15:42:20,517 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 236 flow [2021-06-11 15:42:20,519 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 236 flow [2021-06-11 15:42:20,537 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-06-11 15:42:20,537 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:42:20,538 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-06-11 15:42:20,541 INFO L151 LiptonReduction]: Number of co-enabled transitions 2630 [2021-06-11 15:42:20,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:20,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:20,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:20,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:20,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:20,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:20,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:42:20,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:20,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:20,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:20,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:20,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:20,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:20,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:20,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:20,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:20,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:20,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:20,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:20,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:20,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:20,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:20,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:21,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,026 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:21,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:21,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:42:21,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:21,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:21,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:21,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:21,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:21,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,294 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:21,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:21,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:42:21,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:21,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:21,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:21,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:21,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:21,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,536 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:21,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:21,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:42:21,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,641 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:42:21,642 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:42:21,666 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:21,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:21,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:21,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:21,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,060 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:22,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:22,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:42:22,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,248 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:42:22,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:22,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:22,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:23,154 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 15:42:23,542 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 15:42:23,665 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 15:42:23,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:23,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:23,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:23,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:42:23,705 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:23,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:23,711 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-11 15:42:23,711 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:42:23,715 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:23,719 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-11 15:42:23,719 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:23,722 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-11 15:42:23,723 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-11 15:42:23,723 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:42:23,726 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:23,730 INFO L147 QuantifierPusher]: treesize reduction 100, result has 38.7 percent of original size 63 [2021-06-11 15:42:23,731 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-11 15:42:23,731 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:42:23,735 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:23,739 INFO L147 QuantifierPusher]: treesize reduction 176, result has 33.3 percent of original size 88 [2021-06-11 15:42:23,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:23,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:24,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,071 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:24,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:24,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:42:24,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:24,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:24,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:24,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,385 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:24,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:24,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:42:24,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:24,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:24,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,532 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 15:42:24,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:24,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:24,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:24,804 INFO L142 QuantifierPusher]: treesize reduction 84, result has 91.3 percent of original size [2021-06-11 15:42:24,820 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:24,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:42:24,828 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:24,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:42:24,837 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:24,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,842 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:42:24,843 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:24,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:42:24,848 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:24,849 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 15:42:24,850 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:42:24,850 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:42:24,852 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,853 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 15:42:24,856 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:42:24,858 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,859 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 15:42:24,859 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:42:24,861 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,864 INFO L147 QuantifierPusher]: treesize reduction 141, result has 54.4 percent of original size 168 [2021-06-11 15:42:24,865 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:24,869 INFO L142 QuantifierPusher]: treesize reduction 141, result has 65.9 percent of original size [2021-06-11 15:42:24,870 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 3, 2, 1] term [2021-06-11 15:42:24,871 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:42:24,874 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,881 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 2, 3, 2, 1] term [2021-06-11 15:42:24,881 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:42:24,885 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,886 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 3, 2, 1] term [2021-06-11 15:42:24,886 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:42:24,889 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,895 INFO L147 QuantifierPusher]: treesize reduction 473, result has 25.7 percent of original size 164 [2021-06-11 15:42:24,896 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:42:24,896 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:42:24,898 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,900 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:42:24,900 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:42:24,902 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,903 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:42:24,903 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:42:24,905 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,907 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:24,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,909 INFO L147 QuantifierPusher]: treesize reduction 36, result has 2.7 percent of original size 1 [2021-06-11 15:42:24,909 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:24,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 15:42:24,913 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:24,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:24,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:24,916 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:24,918 INFO L142 QuantifierPusher]: treesize reduction 38, result has 69.6 percent of original size [2021-06-11 15:42:24,920 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 15:42:24,934 INFO L147 QuantifierPusher]: treesize reduction 1984, result has 7.2 percent of original size 153 [2021-06-11 15:42:25,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:25,075 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:25,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:25,076 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:25,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:25,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 15:42:25,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:25,082 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:25,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:25,091 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:25,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:25,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 15:42:25,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 15:42:25,093 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:25,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:25,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 15:42:25,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:42:25,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:25,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:25,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:25,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:25,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:25,460 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:25,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:25,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:25,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:42:25,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:25,858 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:25,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:25,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:25,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:42:26,182 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 15:42:26,362 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 15:42:26,780 WARN L205 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 15:42:26,933 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 15:42:26,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:26,961 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:42:26,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:26,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:26,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:42:26,979 INFO L163 LiptonReduction]: Checked pairs total: 8244 [2021-06-11 15:42:26,979 INFO L165 LiptonReduction]: Total number of compositions: 99 [2021-06-11 15:42:26,984 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6482 [2021-06-11 15:42:27,005 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2021-06-11 15:42:27,005 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:42:27,005 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:27,005 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:27,006 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:27,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:27,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1042985495, now seen corresponding path program 1 times [2021-06-11 15:42:27,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:27,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110359266] [2021-06-11 15:42:27,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:42:27,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:27,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:42:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:42:27,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110359266] [2021-06-11 15:42:27,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:42:27,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:42:27,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626068449] [2021-06-11 15:42:27,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:42:27,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:42:27,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:42:27,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:42:27,191 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 215 [2021-06-11 15:42:27,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:27,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:42:27,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 215 [2021-06-11 15:42:27,195 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:42:27,266 INFO L129 PetriNetUnfolder]: 49/140 cut-off events. [2021-06-11 15:42:27,266 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:42:27,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 140 events. 49/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 600 event pairs, 27 based on Foata normal form. 23/141 useless extension candidates. Maximal degree in co-relation 228. Up to 65 conditions per place. [2021-06-11 15:42:27,270 INFO L132 encePairwiseOnDemand]: 210/215 looper letters, 9 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2021-06-11 15:42:27,270 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 104 flow [2021-06-11 15:42:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:42:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:42:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2021-06-11 15:42:27,287 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8713178294573644 [2021-06-11 15:42:27,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2021-06-11 15:42:27,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2021-06-11 15:42:27,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:42:27,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2021-06-11 15:42:27,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:27,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:27,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:27,305 INFO L185 Difference]: Start difference. First operand has 46 places, 34 transitions, 80 flow. Second operand 3 states and 562 transitions. [2021-06-11 15:42:27,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 104 flow [2021-06-11 15:42:27,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-06-11 15:42:27,308 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 74 flow [2021-06-11 15:42:27,309 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-06-11 15:42:27,309 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2021-06-11 15:42:27,309 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:27,310 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 74 flow [2021-06-11 15:42:27,310 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 74 flow [2021-06-11 15:42:27,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 74 flow [2021-06-11 15:42:27,315 INFO L129 PetriNetUnfolder]: 0/31 cut-off events. [2021-06-11 15:42:27,315 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:42:27,315 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 15:42:27,315 INFO L151 LiptonReduction]: Number of co-enabled transitions 488 [2021-06-11 15:42:28,503 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 249 DAG size of output: 209 [2021-06-11 15:42:29,041 WARN L205 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 207 [2021-06-11 15:42:30,458 WARN L205 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 339 DAG size of output: 292 [2021-06-11 15:42:31,038 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 288 [2021-06-11 15:42:31,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:31,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:31,704 WARN L205 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 193 [2021-06-11 15:42:32,005 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-06-11 15:42:33,400 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 317 DAG size of output: 273 [2021-06-11 15:42:34,078 WARN L205 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-06-11 15:42:34,418 INFO L163 LiptonReduction]: Checked pairs total: 1126 [2021-06-11 15:42:34,418 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 15:42:34,418 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7109 [2021-06-11 15:42:34,418 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 72 flow [2021-06-11 15:42:34,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:34,419 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:34,419 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:34,419 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 15:42:34,419 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:34,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:34,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1064222128, now seen corresponding path program 1 times [2021-06-11 15:42:34,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:34,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636735717] [2021-06-11 15:42:34,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:42:34,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:34,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:42:34,529 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-11 15:42:34,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 15:42:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:42:34,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636735717] [2021-06-11 15:42:34,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:42:34,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:42:34,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986710299] [2021-06-11 15:42:34,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:42:34,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:42:34,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:42:34,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:42:34,554 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 217 [2021-06-11 15:42:34,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:34,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:42:34,554 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 217 [2021-06-11 15:42:34,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:42:34,594 INFO L129 PetriNetUnfolder]: 1/32 cut-off events. [2021-06-11 15:42:34,594 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:42:34,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 32 events. 1/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 42. Up to 3 conditions per place. [2021-06-11 15:42:34,594 INFO L132 encePairwiseOnDemand]: 213/217 looper letters, 1 selfloop transitions, 2 changer transitions 5/32 dead transitions. [2021-06-11 15:42:34,594 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 32 transitions, 88 flow [2021-06-11 15:42:34,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:42:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:42:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 892 transitions. [2021-06-11 15:42:34,598 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8221198156682028 [2021-06-11 15:42:34,598 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 892 transitions. [2021-06-11 15:42:34,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 892 transitions. [2021-06-11 15:42:34,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:42:34,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 892 transitions. [2021-06-11 15:42:34,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:34,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:34,604 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:34,605 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 72 flow. Second operand 5 states and 892 transitions. [2021-06-11 15:42:34,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 32 transitions, 88 flow [2021-06-11 15:42:34,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 32 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:42:34,606 INFO L241 Difference]: Finished difference. Result has 44 places, 27 transitions, 70 flow [2021-06-11 15:42:34,606 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2021-06-11 15:42:34,606 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2021-06-11 15:42:34,607 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:34,607 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 27 transitions, 70 flow [2021-06-11 15:42:34,607 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 27 transitions, 70 flow [2021-06-11 15:42:34,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 27 transitions, 70 flow [2021-06-11 15:42:34,611 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-06-11 15:42:34,611 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:42:34,611 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 15:42:34,612 INFO L151 LiptonReduction]: Number of co-enabled transitions 366 [2021-06-11 15:42:34,718 INFO L163 LiptonReduction]: Checked pairs total: 434 [2021-06-11 15:42:34,718 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:42:34,718 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 111 [2021-06-11 15:42:34,719 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2021-06-11 15:42:34,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:34,719 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:34,720 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:34,720 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 15:42:34,720 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:34,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:34,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1368786629, now seen corresponding path program 1 times [2021-06-11 15:42:34,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:34,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995469741] [2021-06-11 15:42:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:42:34,866 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-06-11 15:42:34,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-06-11 15:42:34,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:34,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:42:34,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995469741] [2021-06-11 15:42:34,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:42:34,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:42:34,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809127285] [2021-06-11 15:42:34,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:42:34,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:42:34,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:42:34,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:42:34,912 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 217 [2021-06-11 15:42:34,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:34,913 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:42:34,913 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 217 [2021-06-11 15:42:34,913 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:42:34,978 INFO L129 PetriNetUnfolder]: 77/166 cut-off events. [2021-06-11 15:42:34,978 INFO L130 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2021-06-11 15:42:34,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 166 events. 77/166 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 709 event pairs, 59 based on Foata normal form. 3/157 useless extension candidates. Maximal degree in co-relation 316. Up to 125 conditions per place. [2021-06-11 15:42:34,980 INFO L132 encePairwiseOnDemand]: 213/217 looper letters, 9 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-06-11 15:42:34,980 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 102 flow [2021-06-11 15:42:34,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:42:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:42:34,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2021-06-11 15:42:34,982 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7665130568356375 [2021-06-11 15:42:34,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2021-06-11 15:42:34,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2021-06-11 15:42:34,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:42:34,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2021-06-11 15:42:34,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:34,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:34,986 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:34,986 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 3 states and 499 transitions. [2021-06-11 15:42:34,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 102 flow [2021-06-11 15:42:34,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:42:34,987 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 85 flow [2021-06-11 15:42:34,988 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-06-11 15:42:34,988 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2021-06-11 15:42:34,988 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:34,988 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 85 flow [2021-06-11 15:42:34,988 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 85 flow [2021-06-11 15:42:34,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 85 flow [2021-06-11 15:42:34,994 INFO L129 PetriNetUnfolder]: 3/39 cut-off events. [2021-06-11 15:42:34,994 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-06-11 15:42:34,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 58. Up to 10 conditions per place. [2021-06-11 15:42:34,995 INFO L151 LiptonReduction]: Number of co-enabled transitions 408 [2021-06-11 15:42:35,015 INFO L163 LiptonReduction]: Checked pairs total: 388 [2021-06-11 15:42:35,015 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:42:35,015 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27 [2021-06-11 15:42:35,016 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 85 flow [2021-06-11 15:42:35,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:35,017 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:35,017 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:35,017 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 15:42:35,017 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:35,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:35,017 INFO L82 PathProgramCache]: Analyzing trace with hash 488616480, now seen corresponding path program 1 times [2021-06-11 15:42:35,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:35,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885130083] [2021-06-11 15:42:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:42:35,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:35,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:42:35,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:35,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:35,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:35,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:42:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:42:35,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885130083] [2021-06-11 15:42:35,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:42:35,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:42:35,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565322156] [2021-06-11 15:42:35,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:42:35,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:42:35,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:42:35,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:42:35,182 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 217 [2021-06-11 15:42:35,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 85 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-06-11 15:42:35,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:42:35,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 217 [2021-06-11 15:42:35,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:42:35,272 INFO L129 PetriNetUnfolder]: 77/167 cut-off events. [2021-06-11 15:42:35,272 INFO L130 PetriNetUnfolder]: For 53/87 co-relation queries the response was YES. [2021-06-11 15:42:35,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 167 events. 77/167 cut-off events. For 53/87 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 701 event pairs, 52 based on Foata normal form. 7/165 useless extension candidates. Maximal degree in co-relation 372. Up to 120 conditions per place. [2021-06-11 15:42:35,274 INFO L132 encePairwiseOnDemand]: 211/217 looper letters, 10 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2021-06-11 15:42:35,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 131 flow [2021-06-11 15:42:35,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:42:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:42:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 673 transitions. [2021-06-11 15:42:35,277 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7753456221198156 [2021-06-11 15:42:35,277 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 673 transitions. [2021-06-11 15:42:35,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 673 transitions. [2021-06-11 15:42:35,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:42:35,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 673 transitions. [2021-06-11 15:42:35,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:35,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:35,281 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:35,282 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 85 flow. Second operand 4 states and 673 transitions. [2021-06-11 15:42:35,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 131 flow [2021-06-11 15:42:35,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:42:35,283 INFO L241 Difference]: Finished difference. Result has 43 places, 32 transitions, 114 flow [2021-06-11 15:42:35,283 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2021-06-11 15:42:35,283 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2021-06-11 15:42:35,284 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:35,284 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 114 flow [2021-06-11 15:42:35,284 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 114 flow [2021-06-11 15:42:35,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 114 flow [2021-06-11 15:42:35,294 INFO L129 PetriNetUnfolder]: 20/75 cut-off events. [2021-06-11 15:42:35,294 INFO L130 PetriNetUnfolder]: For 31/38 co-relation queries the response was YES. [2021-06-11 15:42:35,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 75 events. 20/75 cut-off events. For 31/38 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 227 event pairs, 9 based on Foata normal form. 1/71 useless extension candidates. Maximal degree in co-relation 154. Up to 35 conditions per place. [2021-06-11 15:42:35,295 INFO L151 LiptonReduction]: Number of co-enabled transitions 458 [2021-06-11 15:42:35,331 INFO L163 LiptonReduction]: Checked pairs total: 380 [2021-06-11 15:42:35,331 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:42:35,331 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 47 [2021-06-11 15:42:35,332 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 114 flow [2021-06-11 15:42:35,332 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-06-11 15:42:35,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:35,332 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:35,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 15:42:35,333 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:35,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:35,333 INFO L82 PathProgramCache]: Analyzing trace with hash 181515840, now seen corresponding path program 1 times [2021-06-11 15:42:35,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:35,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704673543] [2021-06-11 15:42:35,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:42:35,423 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-06-11 15:42:35,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 15:42:35,442 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-06-11 15:42:35,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 15:42:35,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:35,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:42:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:42:35,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704673543] [2021-06-11 15:42:35,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:42:35,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:42:35,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022000609] [2021-06-11 15:42:35,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:42:35,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:42:35,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:42:35,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:42:35,472 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 217 [2021-06-11 15:42:35,473 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:35,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:42:35,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 217 [2021-06-11 15:42:35,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:42:35,615 INFO L129 PetriNetUnfolder]: 77/171 cut-off events. [2021-06-11 15:42:35,616 INFO L130 PetriNetUnfolder]: For 136/200 co-relation queries the response was YES. [2021-06-11 15:42:35,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 171 events. 77/171 cut-off events. For 136/200 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 715 event pairs, 29 based on Foata normal form. 9/172 useless extension candidates. Maximal degree in co-relation 456. Up to 103 conditions per place. [2021-06-11 15:42:35,617 INFO L132 encePairwiseOnDemand]: 211/217 looper letters, 14 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2021-06-11 15:42:35,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 184 flow [2021-06-11 15:42:35,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:42:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:42:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 710 transitions. [2021-06-11 15:42:35,620 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8179723502304147 [2021-06-11 15:42:35,620 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 710 transitions. [2021-06-11 15:42:35,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 710 transitions. [2021-06-11 15:42:35,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:42:35,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 710 transitions. [2021-06-11 15:42:35,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 177.5) internal successors, (710), 4 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:35,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:35,625 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:35,625 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 114 flow. Second operand 4 states and 710 transitions. [2021-06-11 15:42:35,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 184 flow [2021-06-11 15:42:35,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 174 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 15:42:35,628 INFO L241 Difference]: Finished difference. Result has 45 places, 35 transitions, 138 flow [2021-06-11 15:42:35,628 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2021-06-11 15:42:35,628 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2021-06-11 15:42:35,628 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:35,628 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 138 flow [2021-06-11 15:42:35,629 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 138 flow [2021-06-11 15:42:35,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 138 flow [2021-06-11 15:42:35,649 INFO L129 PetriNetUnfolder]: 35/103 cut-off events. [2021-06-11 15:42:35,650 INFO L130 PetriNetUnfolder]: For 114/130 co-relation queries the response was YES. [2021-06-11 15:42:35,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 103 events. 35/103 cut-off events. For 114/130 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 394 event pairs, 17 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 259. Up to 49 conditions per place. [2021-06-11 15:42:35,651 INFO L151 LiptonReduction]: Number of co-enabled transitions 506 [2021-06-11 15:42:35,680 INFO L163 LiptonReduction]: Checked pairs total: 391 [2021-06-11 15:42:35,680 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:42:35,680 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 52 [2021-06-11 15:42:35,682 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 138 flow [2021-06-11 15:42:35,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:35,683 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:35,683 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:35,683 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 15:42:35,683 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:35,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:35,683 INFO L82 PathProgramCache]: Analyzing trace with hash -173833967, now seen corresponding path program 1 times [2021-06-11 15:42:35,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:35,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239532975] [2021-06-11 15:42:35,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:42:35,809 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-06-11 15:42:35,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 15:42:35,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:35,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:35,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:35,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 15:42:35,862 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-06-11 15:42:35,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-11 15:42:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:42:35,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239532975] [2021-06-11 15:42:35,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:42:35,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:42:35,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575993611] [2021-06-11 15:42:35,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:42:35,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:42:35,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:42:35,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:42:35,881 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 217 [2021-06-11 15:42:35,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:35,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:42:35,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 217 [2021-06-11 15:42:35,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:42:35,998 INFO L129 PetriNetUnfolder]: 76/174 cut-off events. [2021-06-11 15:42:35,998 INFO L130 PetriNetUnfolder]: For 225/334 co-relation queries the response was YES. [2021-06-11 15:42:35,999 INFO L84 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 174 events. 76/174 cut-off events. For 225/334 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 730 event pairs, 25 based on Foata normal form. 13/180 useless extension candidates. Maximal degree in co-relation 523. Up to 104 conditions per place. [2021-06-11 15:42:36,001 INFO L132 encePairwiseOnDemand]: 212/217 looper letters, 15 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2021-06-11 15:42:36,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 220 flow [2021-06-11 15:42:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:42:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:42:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 670 transitions. [2021-06-11 15:42:36,004 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.771889400921659 [2021-06-11 15:42:36,004 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 670 transitions. [2021-06-11 15:42:36,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 670 transitions. [2021-06-11 15:42:36,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:42:36,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 670 transitions. [2021-06-11 15:42:36,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.5) internal successors, (670), 4 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,009 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,009 INFO L185 Difference]: Start difference. First operand has 45 places, 35 transitions, 138 flow. Second operand 4 states and 670 transitions. [2021-06-11 15:42:36,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 220 flow [2021-06-11 15:42:36,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 211 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-06-11 15:42:36,013 INFO L241 Difference]: Finished difference. Result has 48 places, 37 transitions, 166 flow [2021-06-11 15:42:36,013 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2021-06-11 15:42:36,013 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2021-06-11 15:42:36,014 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:36,014 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 37 transitions, 166 flow [2021-06-11 15:42:36,014 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 37 transitions, 166 flow [2021-06-11 15:42:36,014 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 166 flow [2021-06-11 15:42:36,028 INFO L129 PetriNetUnfolder]: 34/101 cut-off events. [2021-06-11 15:42:36,028 INFO L130 PetriNetUnfolder]: For 196/211 co-relation queries the response was YES. [2021-06-11 15:42:36,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 101 events. 34/101 cut-off events. For 196/211 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 380 event pairs, 17 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 285. Up to 46 conditions per place. [2021-06-11 15:42:36,030 INFO L151 LiptonReduction]: Number of co-enabled transitions 530 [2021-06-11 15:42:36,035 INFO L163 LiptonReduction]: Checked pairs total: 425 [2021-06-11 15:42:36,035 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:42:36,035 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-06-11 15:42:36,036 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 166 flow [2021-06-11 15:42:36,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,037 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:36,037 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:36,037 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-11 15:42:36,037 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:36,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:36,037 INFO L82 PathProgramCache]: Analyzing trace with hash -282051099, now seen corresponding path program 1 times [2021-06-11 15:42:36,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:36,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776564608] [2021-06-11 15:42:36,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:42:36,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:36,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:42:36,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:36,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:42:36,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:36,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 15:42:36,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:36,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:42:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:42:36,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776564608] [2021-06-11 15:42:36,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:42:36,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:42:36,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70451333] [2021-06-11 15:42:36,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:42:36,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:42:36,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:42:36,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:42:36,163 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 217 [2021-06-11 15:42:36,164 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,164 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:42:36,164 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 217 [2021-06-11 15:42:36,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:42:36,274 INFO L129 PetriNetUnfolder]: 87/190 cut-off events. [2021-06-11 15:42:36,275 INFO L130 PetriNetUnfolder]: For 409/579 co-relation queries the response was YES. [2021-06-11 15:42:36,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 190 events. 87/190 cut-off events. For 409/579 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 795 event pairs, 21 based on Foata normal form. 22/205 useless extension candidates. Maximal degree in co-relation 628. Up to 112 conditions per place. [2021-06-11 15:42:36,277 INFO L132 encePairwiseOnDemand]: 209/217 looper letters, 17 selfloop transitions, 13 changer transitions 0/49 dead transitions. [2021-06-11 15:42:36,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 292 flow [2021-06-11 15:42:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:42:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:42:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 842 transitions. [2021-06-11 15:42:36,280 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.776036866359447 [2021-06-11 15:42:36,280 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 842 transitions. [2021-06-11 15:42:36,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 842 transitions. [2021-06-11 15:42:36,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:42:36,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 842 transitions. [2021-06-11 15:42:36,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 168.4) internal successors, (842), 5 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,285 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,285 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 166 flow. Second operand 5 states and 842 transitions. [2021-06-11 15:42:36,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 292 flow [2021-06-11 15:42:36,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 282 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-06-11 15:42:36,289 INFO L241 Difference]: Finished difference. Result has 53 places, 44 transitions, 243 flow [2021-06-11 15:42:36,289 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2021-06-11 15:42:36,289 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2021-06-11 15:42:36,289 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:36,290 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 44 transitions, 243 flow [2021-06-11 15:42:36,290 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 44 transitions, 243 flow [2021-06-11 15:42:36,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 243 flow [2021-06-11 15:42:36,314 INFO L129 PetriNetUnfolder]: 70/174 cut-off events. [2021-06-11 15:42:36,314 INFO L130 PetriNetUnfolder]: For 449/499 co-relation queries the response was YES. [2021-06-11 15:42:36,315 INFO L84 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 174 events. 70/174 cut-off events. For 449/499 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 789 event pairs, 22 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 585. Up to 74 conditions per place. [2021-06-11 15:42:36,317 INFO L151 LiptonReduction]: Number of co-enabled transitions 626 [2021-06-11 15:42:36,325 INFO L163 LiptonReduction]: Checked pairs total: 538 [2021-06-11 15:42:36,325 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:42:36,325 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36 [2021-06-11 15:42:36,326 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 243 flow [2021-06-11 15:42:36,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,326 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:36,327 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:36,327 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-11 15:42:36,327 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:36,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:36,327 INFO L82 PathProgramCache]: Analyzing trace with hash -252558009, now seen corresponding path program 2 times [2021-06-11 15:42:36,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:36,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112171080] [2021-06-11 15:42:36,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:42:36,412 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-06-11 15:42:36,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 15:42:36,437 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-06-11 15:42:36,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 15:42:36,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:36,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 15:42:36,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:36,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 15:42:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:42:36,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112171080] [2021-06-11 15:42:36,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:42:36,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:42:36,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259427550] [2021-06-11 15:42:36,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:42:36,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:42:36,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:42:36,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:42:36,494 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 217 [2021-06-11 15:42:36,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 243 flow. Second operand has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:42:36,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 217 [2021-06-11 15:42:36,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:42:36,613 INFO L129 PetriNetUnfolder]: 96/214 cut-off events. [2021-06-11 15:42:36,613 INFO L130 PetriNetUnfolder]: For 743/1016 co-relation queries the response was YES. [2021-06-11 15:42:36,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 214 events. 96/214 cut-off events. For 743/1016 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 947 event pairs, 28 based on Foata normal form. 31/236 useless extension candidates. Maximal degree in co-relation 830. Up to 136 conditions per place. [2021-06-11 15:42:36,615 INFO L132 encePairwiseOnDemand]: 210/217 looper letters, 14 selfloop transitions, 19 changer transitions 0/52 dead transitions. [2021-06-11 15:42:36,615 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 361 flow [2021-06-11 15:42:36,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:42:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:42:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 899 transitions. [2021-06-11 15:42:36,619 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2021-06-11 15:42:36,619 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 899 transitions. [2021-06-11 15:42:36,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 899 transitions. [2021-06-11 15:42:36,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:42:36,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 899 transitions. [2021-06-11 15:42:36,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,623 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,624 INFO L185 Difference]: Start difference. First operand has 53 places, 44 transitions, 243 flow. Second operand 5 states and 899 transitions. [2021-06-11 15:42:36,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 361 flow [2021-06-11 15:42:36,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 343 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-06-11 15:42:36,626 INFO L241 Difference]: Finished difference. Result has 58 places, 50 transitions, 337 flow [2021-06-11 15:42:36,627 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=337, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2021-06-11 15:42:36,627 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 12 predicate places. [2021-06-11 15:42:36,627 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:36,627 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 50 transitions, 337 flow [2021-06-11 15:42:36,627 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 50 transitions, 337 flow [2021-06-11 15:42:36,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 50 transitions, 337 flow [2021-06-11 15:42:36,653 INFO L129 PetriNetUnfolder]: 67/176 cut-off events. [2021-06-11 15:42:36,653 INFO L130 PetriNetUnfolder]: For 809/931 co-relation queries the response was YES. [2021-06-11 15:42:36,654 INFO L84 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 176 events. 67/176 cut-off events. For 809/931 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 825 event pairs, 17 based on Foata normal form. 8/176 useless extension candidates. Maximal degree in co-relation 718. Up to 80 conditions per place. [2021-06-11 15:42:36,656 INFO L151 LiptonReduction]: Number of co-enabled transitions 726 [2021-06-11 15:42:36,665 INFO L163 LiptonReduction]: Checked pairs total: 720 [2021-06-11 15:42:36,665 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:42:36,665 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-06-11 15:42:36,666 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 337 flow [2021-06-11 15:42:36,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,666 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:36,666 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:36,666 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 15:42:36,666 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:36,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:36,667 INFO L82 PathProgramCache]: Analyzing trace with hash -339004447, now seen corresponding path program 1 times [2021-06-11 15:42:36,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:36,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883437806] [2021-06-11 15:42:36,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:42:36,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:36,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:42:36,706 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:42:36,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:36,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:36,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:42:36,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883437806] [2021-06-11 15:42:36,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:42:36,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:42:36,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427159394] [2021-06-11 15:42:36,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:42:36,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:42:36,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:42:36,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:42:36,716 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 217 [2021-06-11 15:42:36,716 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 337 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,716 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:42:36,716 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 217 [2021-06-11 15:42:36,716 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:42:36,862 INFO L129 PetriNetUnfolder]: 348/680 cut-off events. [2021-06-11 15:42:36,862 INFO L130 PetriNetUnfolder]: For 2064/2232 co-relation queries the response was YES. [2021-06-11 15:42:36,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 680 events. 348/680 cut-off events. For 2064/2232 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 4211 event pairs, 144 based on Foata normal form. 65/677 useless extension candidates. Maximal degree in co-relation 2221. Up to 339 conditions per place. [2021-06-11 15:42:36,870 INFO L132 encePairwiseOnDemand]: 210/217 looper letters, 11 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2021-06-11 15:42:36,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 63 transitions, 405 flow [2021-06-11 15:42:36,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:42:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:42:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 897 transitions. [2021-06-11 15:42:36,873 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8267281105990784 [2021-06-11 15:42:36,873 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 897 transitions. [2021-06-11 15:42:36,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 897 transitions. [2021-06-11 15:42:36,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:42:36,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 897 transitions. [2021-06-11 15:42:36,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,878 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,878 INFO L185 Difference]: Start difference. First operand has 58 places, 50 transitions, 337 flow. Second operand 5 states and 897 transitions. [2021-06-11 15:42:36,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 63 transitions, 405 flow [2021-06-11 15:42:36,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 63 transitions, 384 flow, removed 10 selfloop flow, removed 1 redundant places. [2021-06-11 15:42:36,883 INFO L241 Difference]: Finished difference. Result has 64 places, 59 transitions, 395 flow [2021-06-11 15:42:36,883 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=395, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2021-06-11 15:42:36,883 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2021-06-11 15:42:36,883 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:36,883 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 59 transitions, 395 flow [2021-06-11 15:42:36,884 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 59 transitions, 395 flow [2021-06-11 15:42:36,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 59 transitions, 395 flow [2021-06-11 15:42:36,975 INFO L129 PetriNetUnfolder]: 396/755 cut-off events. [2021-06-11 15:42:36,976 INFO L130 PetriNetUnfolder]: For 2902/3156 co-relation queries the response was YES. [2021-06-11 15:42:36,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2936 conditions, 755 events. 396/755 cut-off events. For 2902/3156 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 4745 event pairs, 155 based on Foata normal form. 13/685 useless extension candidates. Maximal degree in co-relation 2912. Up to 413 conditions per place. [2021-06-11 15:42:36,990 INFO L151 LiptonReduction]: Number of co-enabled transitions 1020 [2021-06-11 15:42:36,998 INFO L163 LiptonReduction]: Checked pairs total: 852 [2021-06-11 15:42:36,998 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:42:36,998 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 115 [2021-06-11 15:42:36,998 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 395 flow [2021-06-11 15:42:36,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:36,999 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:36,999 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:36,999 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-11 15:42:36,999 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:36,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:37,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1761723819, now seen corresponding path program 1 times [2021-06-11 15:42:37,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:37,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727468423] [2021-06-11 15:42:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:42:37,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:37,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:37,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:37,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:42:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:42:37,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727468423] [2021-06-11 15:42:37,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:42:37,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:42:37,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943322508] [2021-06-11 15:42:37,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:42:37,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:42:37,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:42:37,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:42:37,048 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 217 [2021-06-11 15:42:37,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:37,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:42:37,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 217 [2021-06-11 15:42:37,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:42:37,203 INFO L129 PetriNetUnfolder]: 622/1234 cut-off events. [2021-06-11 15:42:37,203 INFO L130 PetriNetUnfolder]: For 5469/6180 co-relation queries the response was YES. [2021-06-11 15:42:37,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4406 conditions, 1234 events. 622/1234 cut-off events. For 5469/6180 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 8958 event pairs, 257 based on Foata normal form. 60/1127 useless extension candidates. Maximal degree in co-relation 4380. Up to 725 conditions per place. [2021-06-11 15:42:37,220 INFO L132 encePairwiseOnDemand]: 214/217 looper letters, 5 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2021-06-11 15:42:37,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 414 flow [2021-06-11 15:42:37,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:42:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:42:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 566 transitions. [2021-06-11 15:42:37,222 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.869431643625192 [2021-06-11 15:42:37,222 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 566 transitions. [2021-06-11 15:42:37,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 566 transitions. [2021-06-11 15:42:37,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:42:37,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 566 transitions. [2021-06-11 15:42:37,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:37,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:37,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:37,225 INFO L185 Difference]: Start difference. First operand has 64 places, 59 transitions, 395 flow. Second operand 3 states and 566 transitions. [2021-06-11 15:42:37,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 414 flow [2021-06-11 15:42:37,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 61 transitions, 409 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:42:37,233 INFO L241 Difference]: Finished difference. Result has 66 places, 60 transitions, 402 flow [2021-06-11 15:42:37,233 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2021-06-11 15:42:37,233 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2021-06-11 15:42:37,233 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:37,234 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 60 transitions, 402 flow [2021-06-11 15:42:37,234 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 60 transitions, 402 flow [2021-06-11 15:42:37,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 60 transitions, 402 flow [2021-06-11 15:42:37,369 INFO L129 PetriNetUnfolder]: 626/1211 cut-off events. [2021-06-11 15:42:37,369 INFO L130 PetriNetUnfolder]: For 4436/4892 co-relation queries the response was YES. [2021-06-11 15:42:37,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 1211 events. 626/1211 cut-off events. For 4436/4892 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 8719 event pairs, 251 based on Foata normal form. 18/1092 useless extension candidates. Maximal degree in co-relation 4453. Up to 714 conditions per place. [2021-06-11 15:42:37,391 INFO L151 LiptonReduction]: Number of co-enabled transitions 1048 [2021-06-11 15:42:37,401 INFO L163 LiptonReduction]: Checked pairs total: 630 [2021-06-11 15:42:37,401 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:42:37,401 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 168 [2021-06-11 15:42:37,402 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 402 flow [2021-06-11 15:42:37,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:37,402 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:37,402 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:37,402 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-11 15:42:37,403 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:37,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:37,403 INFO L82 PathProgramCache]: Analyzing trace with hash -516314133, now seen corresponding path program 2 times [2021-06-11 15:42:37,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:37,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30911345] [2021-06-11 15:42:37,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:42:37,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:37,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:42:37,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:37,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:42:37,467 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:42:37,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:37,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:37,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:42:37,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30911345] [2021-06-11 15:42:37,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:42:37,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:42:37,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327005811] [2021-06-11 15:42:37,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:42:37,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:42:37,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:42:37,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:42:37,477 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 217 [2021-06-11 15:42:37,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 402 flow. Second operand has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:37,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:42:37,478 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 217 [2021-06-11 15:42:37,478 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:42:37,681 INFO L129 PetriNetUnfolder]: 412/895 cut-off events. [2021-06-11 15:42:37,682 INFO L130 PetriNetUnfolder]: For 3448/5357 co-relation queries the response was YES. [2021-06-11 15:42:37,687 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 895 events. 412/895 cut-off events. For 3448/5357 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 6306 event pairs, 70 based on Foata normal form. 292/1099 useless extension candidates. Maximal degree in co-relation 3743. Up to 591 conditions per place. [2021-06-11 15:42:37,692 INFO L132 encePairwiseOnDemand]: 210/217 looper letters, 11 selfloop transitions, 19 changer transitions 0/71 dead transitions. [2021-06-11 15:42:37,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 71 transitions, 518 flow [2021-06-11 15:42:37,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:42:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:42:37,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1256 transitions. [2021-06-11 15:42:37,697 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8268597761685319 [2021-06-11 15:42:37,697 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1256 transitions. [2021-06-11 15:42:37,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1256 transitions. [2021-06-11 15:42:37,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:42:37,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1256 transitions. [2021-06-11 15:42:37,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 179.42857142857142) internal successors, (1256), 7 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:37,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:37,704 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:37,704 INFO L185 Difference]: Start difference. First operand has 66 places, 60 transitions, 402 flow. Second operand 7 states and 1256 transitions. [2021-06-11 15:42:37,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 71 transitions, 518 flow [2021-06-11 15:42:37,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 71 transitions, 516 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:42:37,713 INFO L241 Difference]: Finished difference. Result has 74 places, 67 transitions, 518 flow [2021-06-11 15:42:37,713 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=518, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2021-06-11 15:42:37,713 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2021-06-11 15:42:37,713 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:37,713 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 67 transitions, 518 flow [2021-06-11 15:42:37,713 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 67 transitions, 518 flow [2021-06-11 15:42:37,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 67 transitions, 518 flow [2021-06-11 15:42:37,818 INFO L129 PetriNetUnfolder]: 435/937 cut-off events. [2021-06-11 15:42:37,818 INFO L130 PetriNetUnfolder]: For 5030/6160 co-relation queries the response was YES. [2021-06-11 15:42:37,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4564 conditions, 937 events. 435/937 cut-off events. For 5030/6160 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 6838 event pairs, 67 based on Foata normal form. 35/892 useless extension candidates. Maximal degree in co-relation 4535. Up to 636 conditions per place. [2021-06-11 15:42:37,837 INFO L151 LiptonReduction]: Number of co-enabled transitions 1254 [2021-06-11 15:42:37,847 INFO L163 LiptonReduction]: Checked pairs total: 743 [2021-06-11 15:42:37,847 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:42:37,847 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 134 [2021-06-11 15:42:37,849 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 518 flow [2021-06-11 15:42:37,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:37,850 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:37,850 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:37,850 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-11 15:42:37,850 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:37,851 INFO L82 PathProgramCache]: Analyzing trace with hash -788237118, now seen corresponding path program 1 times [2021-06-11 15:42:37,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:37,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007801460] [2021-06-11 15:42:37,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:42:37,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:37,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:42:37,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:37,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:42:37,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:37,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:42:37,919 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:42:37,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:37,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:37,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:42:37,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007801460] [2021-06-11 15:42:37,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:42:37,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:42:37,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75533464] [2021-06-11 15:42:37,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:42:37,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:42:37,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:42:37,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:42:37,931 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 217 [2021-06-11 15:42:37,932 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:37,932 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:42:37,932 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 217 [2021-06-11 15:42:37,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:42:38,099 INFO L129 PetriNetUnfolder]: 306/702 cut-off events. [2021-06-11 15:42:38,100 INFO L130 PetriNetUnfolder]: For 4599/9742 co-relation queries the response was YES. [2021-06-11 15:42:38,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3817 conditions, 702 events. 306/702 cut-off events. For 4599/9742 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 4804 event pairs, 11 based on Foata normal form. 450/1076 useless extension candidates. Maximal degree in co-relation 3786. Up to 540 conditions per place. [2021-06-11 15:42:38,110 INFO L132 encePairwiseOnDemand]: 210/217 looper letters, 6 selfloop transitions, 28 changer transitions 4/75 dead transitions. [2021-06-11 15:42:38,110 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 75 transitions, 672 flow [2021-06-11 15:42:38,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 15:42:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 15:42:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1615 transitions. [2021-06-11 15:42:38,114 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8269329237071172 [2021-06-11 15:42:38,114 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1615 transitions. [2021-06-11 15:42:38,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1615 transitions. [2021-06-11 15:42:38,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:42:38,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1615 transitions. [2021-06-11 15:42:38,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 179.44444444444446) internal successors, (1615), 9 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:38,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:38,122 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:38,122 INFO L185 Difference]: Start difference. First operand has 74 places, 67 transitions, 518 flow. Second operand 9 states and 1615 transitions. [2021-06-11 15:42:38,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 75 transitions, 672 flow [2021-06-11 15:42:38,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 75 transitions, 601 flow, removed 18 selfloop flow, removed 7 redundant places. [2021-06-11 15:42:38,132 INFO L241 Difference]: Finished difference. Result has 78 places, 71 transitions, 577 flow [2021-06-11 15:42:38,132 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=577, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2021-06-11 15:42:38,133 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 32 predicate places. [2021-06-11 15:42:38,133 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:38,133 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 71 transitions, 577 flow [2021-06-11 15:42:38,133 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 71 transitions, 577 flow [2021-06-11 15:42:38,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 71 transitions, 577 flow [2021-06-11 15:42:38,204 INFO L129 PetriNetUnfolder]: 305/713 cut-off events. [2021-06-11 15:42:38,204 INFO L130 PetriNetUnfolder]: For 3865/4057 co-relation queries the response was YES. [2021-06-11 15:42:38,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3565 conditions, 713 events. 305/713 cut-off events. For 3865/4057 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5059 event pairs, 8 based on Foata normal form. 5/657 useless extension candidates. Maximal degree in co-relation 3535. Up to 389 conditions per place. [2021-06-11 15:42:38,218 INFO L151 LiptonReduction]: Number of co-enabled transitions 1346 [2021-06-11 15:42:38,229 INFO L163 LiptonReduction]: Checked pairs total: 885 [2021-06-11 15:42:38,230 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:42:38,230 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 97 [2021-06-11 15:42:38,230 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 577 flow [2021-06-11 15:42:38,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:38,231 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:38,231 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:38,231 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-11 15:42:38,231 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:38,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:38,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1272151584, now seen corresponding path program 1 times [2021-06-11 15:42:38,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:38,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119415842] [2021-06-11 15:42:38,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:42:38,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:38,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 15:42:38,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:38,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 15:42:38,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:38,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 15:42:38,358 INFO L142 QuantifierPusher]: treesize reduction 36, result has 67.6 percent of original size [2021-06-11 15:42:38,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 75 [2021-06-11 15:42:38,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:38,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:42:38,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:38,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:42:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:42:38,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119415842] [2021-06-11 15:42:38,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:42:38,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 15:42:38,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370437215] [2021-06-11 15:42:38,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 15:42:38,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:42:38,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 15:42:38,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-06-11 15:42:38,410 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 217 [2021-06-11 15:42:38,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 577 flow. Second operand has 8 states, 8 states have (on average 158.0) internal successors, (1264), 8 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:38,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:42:38,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 217 [2021-06-11 15:42:38,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:42:38,921 INFO L129 PetriNetUnfolder]: 806/1873 cut-off events. [2021-06-11 15:42:38,922 INFO L130 PetriNetUnfolder]: For 16233/21102 co-relation queries the response was YES. [2021-06-11 15:42:38,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9090 conditions, 1873 events. 806/1873 cut-off events. For 16233/21102 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 15915 event pairs, 24 based on Foata normal form. 172/1825 useless extension candidates. Maximal degree in co-relation 9058. Up to 879 conditions per place. [2021-06-11 15:42:38,947 INFO L132 encePairwiseOnDemand]: 211/217 looper letters, 30 selfloop transitions, 10 changer transitions 27/112 dead transitions. [2021-06-11 15:42:38,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 112 transitions, 1051 flow [2021-06-11 15:42:38,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 15:42:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 15:42:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1455 transitions. [2021-06-11 15:42:38,951 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7450076804915514 [2021-06-11 15:42:38,951 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1455 transitions. [2021-06-11 15:42:38,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1455 transitions. [2021-06-11 15:42:38,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:42:38,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1455 transitions. [2021-06-11 15:42:38,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 161.66666666666666) internal successors, (1455), 9 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:38,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:38,971 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:38,971 INFO L185 Difference]: Start difference. First operand has 78 places, 71 transitions, 577 flow. Second operand 9 states and 1455 transitions. [2021-06-11 15:42:38,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 112 transitions, 1051 flow [2021-06-11 15:42:39,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 112 transitions, 954 flow, removed 34 selfloop flow, removed 4 redundant places. [2021-06-11 15:42:39,101 INFO L241 Difference]: Finished difference. Result has 87 places, 74 transitions, 538 flow [2021-06-11 15:42:39,102 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=538, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2021-06-11 15:42:39,102 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 41 predicate places. [2021-06-11 15:42:39,102 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:39,102 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 74 transitions, 538 flow [2021-06-11 15:42:39,102 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 74 transitions, 538 flow [2021-06-11 15:42:39,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 74 transitions, 538 flow [2021-06-11 15:42:39,216 INFO L129 PetriNetUnfolder]: 556/1284 cut-off events. [2021-06-11 15:42:39,216 INFO L130 PetriNetUnfolder]: For 3994/4183 co-relation queries the response was YES. [2021-06-11 15:42:39,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4789 conditions, 1284 events. 556/1284 cut-off events. For 3994/4183 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 10390 event pairs, 17 based on Foata normal form. 11/1146 useless extension candidates. Maximal degree in co-relation 4753. Up to 357 conditions per place. [2021-06-11 15:42:39,241 INFO L151 LiptonReduction]: Number of co-enabled transitions 1440 [2021-06-11 15:42:39,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:39,280 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:42:39,281 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:42:39,281 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:39,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:39,317 INFO L163 LiptonReduction]: Checked pairs total: 796 [2021-06-11 15:42:39,317 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 15:42:39,317 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 215 [2021-06-11 15:42:39,318 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 74 transitions, 539 flow [2021-06-11 15:42:39,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 158.0) internal successors, (1264), 8 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:39,319 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:39,319 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:39,319 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-11 15:42:39,319 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:39,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:39,319 INFO L82 PathProgramCache]: Analyzing trace with hash -656640034, now seen corresponding path program 1 times [2021-06-11 15:42:39,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:39,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597235763] [2021-06-11 15:42:39,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:42:39,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:39,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:39,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:39,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:42:39,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:39,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:42:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:42:39,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597235763] [2021-06-11 15:42:39,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:42:39,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:42:39,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055181011] [2021-06-11 15:42:39,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:42:39,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:42:39,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:42:39,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:42:39,392 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 218 [2021-06-11 15:42:39,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 74 transitions, 539 flow. Second operand has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:39,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:42:39,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 218 [2021-06-11 15:42:39,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:42:39,734 INFO L129 PetriNetUnfolder]: 1197/2789 cut-off events. [2021-06-11 15:42:39,734 INFO L130 PetriNetUnfolder]: For 8812/9297 co-relation queries the response was YES. [2021-06-11 15:42:39,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10256 conditions, 2789 events. 1197/2789 cut-off events. For 8812/9297 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 25984 event pairs, 40 based on Foata normal form. 29/2510 useless extension candidates. Maximal degree in co-relation 10218. Up to 787 conditions per place. [2021-06-11 15:42:39,760 INFO L132 encePairwiseOnDemand]: 215/218 looper letters, 4 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2021-06-11 15:42:39,761 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 76 transitions, 577 flow [2021-06-11 15:42:39,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:42:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:42:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 751 transitions. [2021-06-11 15:42:39,763 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8612385321100917 [2021-06-11 15:42:39,763 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 751 transitions. [2021-06-11 15:42:39,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 751 transitions. [2021-06-11 15:42:39,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:42:39,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 751 transitions. [2021-06-11 15:42:39,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:39,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:39,767 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:39,767 INFO L185 Difference]: Start difference. First operand has 85 places, 74 transitions, 539 flow. Second operand 4 states and 751 transitions. [2021-06-11 15:42:39,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 76 transitions, 577 flow [2021-06-11 15:42:39,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 76 transitions, 567 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-06-11 15:42:39,935 INFO L241 Difference]: Finished difference. Result has 88 places, 75 transitions, 544 flow [2021-06-11 15:42:39,936 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=544, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2021-06-11 15:42:39,936 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 42 predicate places. [2021-06-11 15:42:39,936 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:39,936 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 75 transitions, 544 flow [2021-06-11 15:42:39,936 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 75 transitions, 544 flow [2021-06-11 15:42:39,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 75 transitions, 544 flow [2021-06-11 15:42:40,175 INFO L129 PetriNetUnfolder]: 1110/2526 cut-off events. [2021-06-11 15:42:40,175 INFO L130 PetriNetUnfolder]: For 7226/7545 co-relation queries the response was YES. [2021-06-11 15:42:40,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9358 conditions, 2526 events. 1110/2526 cut-off events. For 7226/7545 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 23142 event pairs, 30 based on Foata normal form. 19/2252 useless extension candidates. Maximal degree in co-relation 9321. Up to 720 conditions per place. [2021-06-11 15:42:40,227 INFO L151 LiptonReduction]: Number of co-enabled transitions 1494 [2021-06-11 15:42:40,239 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:42:40,240 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:42:40,240 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 304 [2021-06-11 15:42:40,240 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 544 flow [2021-06-11 15:42:40,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:40,241 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:40,241 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:40,241 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-11 15:42:40,241 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:40,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:40,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1665142223, now seen corresponding path program 1 times [2021-06-11 15:42:40,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:40,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514503984] [2021-06-11 15:42:40,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:42:40,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:40,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:42:40,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:40,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:42:40,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:40,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:42:40,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:40,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:42:40,325 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:42:40,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:42:40,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:40,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:42:40,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514503984] [2021-06-11 15:42:40,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:42:40,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 15:42:40,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058640135] [2021-06-11 15:42:40,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:42:40,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:42:40,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:42:40,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:42:40,337 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 218 [2021-06-11 15:42:40,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 544 flow. Second operand has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:40,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:42:40,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 218 [2021-06-11 15:42:40,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:42:40,803 INFO L129 PetriNetUnfolder]: 1152/2669 cut-off events. [2021-06-11 15:42:40,803 INFO L130 PetriNetUnfolder]: For 12332/19329 co-relation queries the response was YES. [2021-06-11 15:42:40,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11643 conditions, 2669 events. 1152/2669 cut-off events. For 12332/19329 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 25007 event pairs, 22 based on Foata normal form. 1598/3961 useless extension candidates. Maximal degree in co-relation 11604. Up to 770 conditions per place. [2021-06-11 15:42:40,823 INFO L132 encePairwiseOnDemand]: 211/218 looper letters, 2 selfloop transitions, 33 changer transitions 19/80 dead transitions. [2021-06-11 15:42:40,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 80 transitions, 678 flow [2021-06-11 15:42:40,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 15:42:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 15:42:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1977 transitions. [2021-06-11 15:42:40,828 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8244370308590492 [2021-06-11 15:42:40,828 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1977 transitions. [2021-06-11 15:42:40,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1977 transitions. [2021-06-11 15:42:40,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:42:40,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1977 transitions. [2021-06-11 15:42:40,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 179.72727272727272) internal successors, (1977), 11 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:40,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 218.0) internal successors, (2616), 12 states have internal predecessors, (2616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:40,837 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 218.0) internal successors, (2616), 12 states have internal predecessors, (2616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:40,838 INFO L185 Difference]: Start difference. First operand has 88 places, 75 transitions, 544 flow. Second operand 11 states and 1977 transitions. [2021-06-11 15:42:40,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 80 transitions, 678 flow [2021-06-11 15:42:40,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 80 transitions, 650 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-06-11 15:42:40,965 INFO L241 Difference]: Finished difference. Result has 98 places, 61 transitions, 489 flow [2021-06-11 15:42:40,966 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=489, PETRI_PLACES=98, PETRI_TRANSITIONS=61} [2021-06-11 15:42:40,966 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 52 predicate places. [2021-06-11 15:42:40,966 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:42:40,966 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 61 transitions, 489 flow [2021-06-11 15:42:40,966 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 61 transitions, 489 flow [2021-06-11 15:42:40,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 61 transitions, 489 flow [2021-06-11 15:42:41,007 INFO L129 PetriNetUnfolder]: 176/446 cut-off events. [2021-06-11 15:42:41,007 INFO L130 PetriNetUnfolder]: For 1314/1387 co-relation queries the response was YES. [2021-06-11 15:42:41,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 446 events. 176/446 cut-off events. For 1314/1387 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2930 event pairs, 2 based on Foata normal form. 1/415 useless extension candidates. Maximal degree in co-relation 1905. Up to 130 conditions per place. [2021-06-11 15:42:41,013 INFO L151 LiptonReduction]: Number of co-enabled transitions 754 [2021-06-11 15:42:41,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:41,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:41,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:41,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:41,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:42:41,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:42:41,121 INFO L163 LiptonReduction]: Checked pairs total: 141 [2021-06-11 15:42:41,122 INFO L165 LiptonReduction]: Total number of compositions: 4 [2021-06-11 15:42:41,122 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 156 [2021-06-11 15:42:41,122 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 58 transitions, 486 flow [2021-06-11 15:42:41,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:42:41,123 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:42:41,123 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:42:41,123 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-11 15:42:41,123 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:42:41,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:42:41,123 INFO L82 PathProgramCache]: Analyzing trace with hash -122433622, now seen corresponding path program 1 times [2021-06-11 15:42:41,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:42:41,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956804885] [2021-06-11 15:42:41,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:42:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:42:41,170 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:42:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:42:41,214 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:42:41,257 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 15:42:41,259 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 15:42:41,260 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-11 15:42:41,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 03:42:41 BasicIcfg [2021-06-11 15:42:41,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 15:42:41,378 INFO L168 Benchmark]: Toolchain (without parser) took 23722.54 ms. Allocated memory was 339.7 MB in the beginning and 708.8 MB in the end (delta: 369.1 MB). Free memory was 302.3 MB in the beginning and 492.0 MB in the end (delta: -189.6 MB). Peak memory consumption was 180.7 MB. Max. memory is 16.0 GB. [2021-06-11 15:42:41,378 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 339.7 MB. Free memory is still 320.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:42:41,378 INFO L168 Benchmark]: CACSL2BoogieTranslator took 572.15 ms. Allocated memory is still 339.7 MB. Free memory was 302.1 MB in the beginning and 298.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-06-11 15:42:41,378 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.44 ms. Allocated memory is still 339.7 MB. Free memory was 298.0 MB in the beginning and 294.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:42:41,379 INFO L168 Benchmark]: Boogie Preprocessor took 56.56 ms. Allocated memory is still 339.7 MB. Free memory was 294.8 MB in the beginning and 292.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:42:41,379 INFO L168 Benchmark]: RCFGBuilder took 1908.21 ms. Allocated memory is still 339.7 MB. Free memory was 292.7 MB in the beginning and 241.8 MB in the end (delta: 50.9 MB). Peak memory consumption was 154.7 MB. Max. memory is 16.0 GB. [2021-06-11 15:42:41,384 INFO L168 Benchmark]: TraceAbstraction took 21091.58 ms. Allocated memory was 339.7 MB in the beginning and 708.8 MB in the end (delta: 369.1 MB). Free memory was 240.8 MB in the beginning and 492.0 MB in the end (delta: -251.2 MB). Peak memory consumption was 119.0 MB. Max. memory is 16.0 GB. [2021-06-11 15:42:41,385 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 339.7 MB. Free memory is still 320.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 572.15 ms. Allocated memory is still 339.7 MB. Free memory was 302.1 MB in the beginning and 298.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 86.44 ms. Allocated memory is still 339.7 MB. Free memory was 298.0 MB in the beginning and 294.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 56.56 ms. Allocated memory is still 339.7 MB. Free memory was 294.8 MB in the beginning and 292.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1908.21 ms. Allocated memory is still 339.7 MB. Free memory was 292.7 MB in the beginning and 241.8 MB in the end (delta: 50.9 MB). Peak memory consumption was 154.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 21091.58 ms. Allocated memory was 339.7 MB in the beginning and 708.8 MB in the end (delta: 369.1 MB). Free memory was 240.8 MB in the beginning and 492.0 MB in the end (delta: -251.2 MB). Peak memory consumption was 119.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6462.2ms, 123 PlacesBefore, 46 PlacesAfterwards, 112 TransitionsBefore, 34 TransitionsAfterwards, 2630 CoEnabledTransitionPairs, 8 FixpointIterations, 40 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 8244 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3668, positive: 3445, positive conditional: 3445, positive unconditional: 0, negative: 223, negative conditional: 223, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3668, positive: 3445, positive conditional: 0, positive unconditional: 3445, negative: 223, negative conditional: 0, negative unconditional: 223, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3668, positive: 3445, positive conditional: 0, positive unconditional: 3445, negative: 223, negative conditional: 0, negative unconditional: 223, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2106, positive: 2054, positive conditional: 0, positive unconditional: 2054, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2106, positive: 2028, positive conditional: 0, positive unconditional: 2028, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 697, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 633, negative conditional: 0, negative unconditional: 633, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3668, positive: 1391, positive conditional: 0, positive unconditional: 1391, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 2106, unknown conditional: 0, unknown unconditional: 2106] , Statistics on independence cache: Total cache size (in pairs): 2106, Positive cache size: 2054, Positive conditional cache size: 0, Positive unconditional cache size: 2054, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7108.0ms, 42 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1126 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 376, positive: 320, positive conditional: 320, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 376, positive: 320, positive conditional: 18, positive unconditional: 302, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 376, positive: 320, positive conditional: 18, positive unconditional: 302, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 58, positive: 49, positive conditional: 7, positive unconditional: 42, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 58, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 339, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 247, negative conditional: 0, negative unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 376, positive: 271, positive conditional: 11, positive unconditional: 260, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 58, unknown conditional: 7, unknown unconditional: 51] , Statistics on independence cache: Total cache size (in pairs): 2164, Positive cache size: 2103, Positive conditional cache size: 7, Positive unconditional cache size: 2096, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 111.1ms, 44 PlacesBefore, 39 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 434 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154, positive: 129, positive conditional: 129, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 154, positive: 129, positive conditional: 0, positive unconditional: 129, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 154, positive: 129, positive conditional: 0, positive unconditional: 129, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 103, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 2183, Positive cache size: 2119, Positive conditional cache size: 7, Positive unconditional cache size: 2112, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.8ms, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 388 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 158, positive: 137, positive conditional: 137, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 158, positive: 137, positive conditional: 2, positive unconditional: 135, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 158, positive: 137, positive conditional: 2, positive unconditional: 135, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 158, positive: 130, positive conditional: 2, positive unconditional: 128, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 2191, Positive cache size: 2126, Positive conditional cache size: 7, Positive unconditional cache size: 2119, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 46.8ms, 43 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 380 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 178, positive: 160, positive conditional: 160, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 178, positive: 160, positive conditional: 17, positive unconditional: 143, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 178, positive: 160, positive conditional: 17, positive unconditional: 143, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 7, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 178, positive: 151, positive conditional: 10, positive unconditional: 141, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 9, unknown conditional: 7, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2200, Positive cache size: 2135, Positive conditional cache size: 14, Positive unconditional cache size: 2121, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.3ms, 45 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 391 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 189, positive: 172, positive conditional: 172, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 189, positive: 172, positive conditional: 30, positive unconditional: 142, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 189, positive: 172, positive conditional: 30, positive unconditional: 142, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 3, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 189, positive: 164, positive conditional: 27, positive unconditional: 137, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 2208, Positive cache size: 2143, Positive conditional cache size: 17, Positive unconditional cache size: 2126, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.3ms, 48 PlacesBefore, 48 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 425 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 205, positive: 187, positive conditional: 187, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 205, positive: 187, positive conditional: 33, positive unconditional: 154, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 205, positive: 187, positive conditional: 33, positive unconditional: 154, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 2, 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: 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: 205, positive: 184, positive conditional: 31, positive unconditional: 153, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2211, Positive cache size: 2146, Positive conditional cache size: 19, Positive unconditional cache size: 2127, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.2ms, 53 PlacesBefore, 53 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 626 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 538 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 225, positive: 205, positive conditional: 205, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 225, positive: 205, positive conditional: 57, positive unconditional: 148, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 225, positive: 205, positive conditional: 57, positive unconditional: 148, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 225, positive: 202, positive conditional: 54, positive unconditional: 148, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2214, Positive cache size: 2149, Positive conditional cache size: 22, Positive unconditional cache size: 2127, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.8ms, 58 PlacesBefore, 58 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 720 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 273, positive: 249, positive conditional: 249, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 273, positive: 249, positive conditional: 105, positive unconditional: 144, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 273, positive: 249, positive conditional: 105, positive unconditional: 144, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 273, positive: 244, positive conditional: 105, positive unconditional: 139, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 2219, Positive cache size: 2154, Positive conditional cache size: 22, Positive unconditional cache size: 2132, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 52 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 114.2ms, 64 PlacesBefore, 64 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 852 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, positive: 279, positive conditional: 279, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 302, positive: 279, positive conditional: 158, positive unconditional: 121, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 302, positive: 279, positive conditional: 158, positive unconditional: 121, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 302, positive: 279, positive conditional: 158, positive unconditional: 121, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2219, Positive cache size: 2154, Positive conditional cache size: 22, Positive unconditional cache size: 2132, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 42 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 167.4ms, 66 PlacesBefore, 66 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 1048 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 630 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, positive: 92, positive conditional: 92, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, positive: 92, positive conditional: 35, positive unconditional: 57, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 92, positive conditional: 35, positive unconditional: 57, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 108, positive: 91, positive conditional: 35, positive unconditional: 56, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2220, Positive cache size: 2155, Positive conditional cache size: 22, Positive unconditional cache size: 2133, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 133.5ms, 74 PlacesBefore, 74 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 743 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, positive: 88, positive conditional: 88, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 105, positive: 88, positive conditional: 49, positive unconditional: 39, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 105, positive: 88, positive conditional: 49, positive unconditional: 39, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 105, positive: 88, positive conditional: 49, positive unconditional: 39, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2220, Positive cache size: 2155, Positive conditional cache size: 22, Positive unconditional cache size: 2133, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 96.7ms, 78 PlacesBefore, 78 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 885 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 443, positive: 425, positive conditional: 425, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 443, positive: 425, positive conditional: 272, positive unconditional: 153, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 443, positive: 425, positive conditional: 272, positive unconditional: 153, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 443, positive: 423, positive conditional: 270, positive unconditional: 153, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2222, Positive cache size: 2157, Positive conditional cache size: 24, Positive unconditional cache size: 2133, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 64 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 214.6ms, 87 PlacesBefore, 85 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 1440 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 796 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, positive: 148, positive conditional: 148, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, positive: 148, positive conditional: 89, positive unconditional: 59, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, positive: 148, positive conditional: 89, positive unconditional: 59, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 164, positive: 147, positive conditional: 89, positive unconditional: 58, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2223, Positive cache size: 2158, Positive conditional cache size: 24, Positive unconditional cache size: 2134, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 47 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 303.4ms, 88 PlacesBefore, 88 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1494 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2223, Positive cache size: 2158, Positive conditional cache size: 24, Positive unconditional cache size: 2134, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 155.4ms, 98 PlacesBefore, 87 PlacesAfterwards, 61 TransitionsBefore, 58 TransitionsAfterwards, 754 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 141 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, positive: 141, positive conditional: 141, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 141, positive: 141, positive conditional: 101, positive unconditional: 40, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 141, positive: 141, positive conditional: 101, positive unconditional: 40, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , 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: 141, positive: 139, positive conditional: 101, positive unconditional: 38, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2225, Positive cache size: 2160, Positive conditional cache size: 24, Positive unconditional cache size: 2136, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 16 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t776; [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L771] 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) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] 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) [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 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 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] 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) [L859] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L859] 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) [L859] 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) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 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 [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 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 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 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) [L870] 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) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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)) [L876] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20839.8ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3570.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6575.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 79 SDtfs, 54 SDslu, 39 SDs, 0 SdLazy, 494 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 588.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 595.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=577occurred in iteration=12, InterpolantAutomatonStates: 81, 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.6ms SsaConstructionTime, 493.3ms SatisfiabilityAnalysisTime, 1218.4ms InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 2116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...