/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/safe004_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:28:25,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:28:25,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:28:25,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:28:25,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:28:25,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:28:25,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:28:25,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:28:25,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:28:25,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:28:25,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:28:25,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:28:25,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:28:25,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:28:25,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:28:25,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:28:25,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:28:25,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:28:25,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:28:25,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:28:25,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:28:25,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:28:25,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:28:25,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:28:25,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:28:25,475 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:28:25,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:28:25,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:28:25,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:28:25,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:28:25,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:28:25,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:28:25,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:28:25,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:28:25,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:28:25,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:28:25,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:28:25,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:28:25,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:28:25,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:28:25,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:28:25,482 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-03-26 10:28:25,496 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:28:25,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:28:25,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:28:25,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:28:25,497 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:28:25,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:28:25,497 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:28:25,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:28:25,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:28:25,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:28:25,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:28:25,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:28:25,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:28:25,498 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:28:25,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:28:25,498 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:28:25,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:28:25,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:28:25,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:28:25,498 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:28:25,498 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:28:25,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:28:25,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:28:25,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:28:25,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:28:25,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:28:25,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:28:25,499 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:28:25,499 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:28:25,499 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:28:25,499 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:28:25,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:28:25,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:28:25,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:28:25,737 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:28:25,737 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:28:25,739 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc.i [2021-03-26 10:28:25,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f3ef9fdc/252634ab431d4a16bd9cfb5da46ba111/FLAGfeb8e05ca [2021-03-26 10:28:26,197 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:28:26,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.oepc.i [2021-03-26 10:28:26,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f3ef9fdc/252634ab431d4a16bd9cfb5da46ba111/FLAGfeb8e05ca [2021-03-26 10:28:26,522 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f3ef9fdc/252634ab431d4a16bd9cfb5da46ba111 [2021-03-26 10:28:26,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:28:26,525 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:28:26,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:28:26,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:28:26,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:28:26,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:28:26" (1/1) ... [2021-03-26 10:28:26,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2e6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:26, skipping insertion in model container [2021-03-26 10:28:26,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:28:26" (1/1) ... [2021-03-26 10:28:26,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:28:26,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:28:26,696 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/safe004_power.oepc.i[952,965] [2021-03-26 10:28:26,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:28:26,918 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:28:26,940 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/safe004_power.oepc.i[952,965] [2021-03-26 10:28:26,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:28:27,042 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:28:27,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:27 WrapperNode [2021-03-26 10:28:27,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:28:27,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:28:27,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:28:27,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:28:27,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:27" (1/1) ... [2021-03-26 10:28:27,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:27" (1/1) ... [2021-03-26 10:28:27,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:28:27,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:28:27,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:28:27,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:28:27,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:27" (1/1) ... [2021-03-26 10:28:27,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:27" (1/1) ... [2021-03-26 10:28:27,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:27" (1/1) ... [2021-03-26 10:28:27,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:27" (1/1) ... [2021-03-26 10:28:27,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:27" (1/1) ... [2021-03-26 10:28:27,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:27" (1/1) ... [2021-03-26 10:28:27,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:27" (1/1) ... [2021-03-26 10:28:27,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:28:27,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:28:27,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:28:27,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:28:27,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:28:27,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:28:27,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:28:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:28:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:28:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:28:27,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:28:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:28:27,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:28:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:28:27,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:28:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:28:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:28:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:28:27,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:28:27,251 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:28:29,424 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:28:29,425 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:28:29,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:28:29 BoogieIcfgContainer [2021-03-26 10:28:29,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:28:29,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:28:29,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:28:29,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:28:29,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:28:26" (1/3) ... [2021-03-26 10:28:29,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ca4da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:28:29, skipping insertion in model container [2021-03-26 10:28:29,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:27" (2/3) ... [2021-03-26 10:28:29,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ca4da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:28:29, skipping insertion in model container [2021-03-26 10:28:29,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:28:29" (3/3) ... [2021-03-26 10:28:29,430 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc.i [2021-03-26 10:28:29,435 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:28:29,438 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:28:29,439 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:28:29,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,470 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,470 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,471 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,471 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,471 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,471 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,471 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,471 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,476 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,476 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,476 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,477 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,495 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,495 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,496 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,497 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,497 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,501 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,502 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,503 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:28:29,515 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:28:29,527 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:28:29,528 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:28:29,528 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:28:29,528 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:28:29,528 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:28:29,528 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:28:29,528 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:28:29,528 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:28:29,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:28:29,557 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:28:29,557 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:28:29,559 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:28:29,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:28:29,562 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 10:28:29,563 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:29,572 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:28:29,575 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:28:29,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 10:28:29,587 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:28:29,587 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:28:29,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:28:29,589 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-26 10:28:31,163 WARN L205 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 175 [2021-03-26 10:28:31,771 WARN L205 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 172 [2021-03-26 10:28:32,979 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 299 DAG size of output: 255 [2021-03-26 10:28:33,525 WARN L205 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:28:33,720 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:28:34,089 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:28:34,197 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:28:35,151 WARN L205 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 10:28:35,692 WARN L205 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-26 10:28:36,986 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:28:37,533 WARN L205 SmtUtils]: Spent 545.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:28:38,215 INFO L154 LiptonReduction]: Checked pairs total: 3074 [2021-03-26 10:28:38,216 INFO L156 LiptonReduction]: Total number of compositions: 61 [2021-03-26 10:28:38,217 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8654 [2021-03-26 10:28:38,223 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-03-26 10:28:38,223 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:28:38,223 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:38,223 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:38,224 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:38,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:38,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1884620492, now seen corresponding path program 1 times [2021-03-26 10:28:38,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:38,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705785036] [2021-03-26 10:28:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:38,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:38,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:28:38,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:38,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:38,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705785036] [2021-03-26 10:28:38,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:38,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:28:38,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514832606] [2021-03-26 10:28:38,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:28:38,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:38,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:28:38,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:28:38,423 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 158 [2021-03-26 10:28:38,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:38,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:38,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 158 [2021-03-26 10:28:38,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:38,540 INFO L129 PetriNetUnfolder]: 115/347 cut-off events. [2021-03-26 10:28:38,540 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:28:38,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 347 events. 115/347 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2009 event pairs, 92 based on Foata normal form. 21/336 useless extension candidates. Maximal degree in co-relation 526. Up to 141 conditions per place. [2021-03-26 10:28:38,546 INFO L132 encePairwiseOnDemand]: 154/158 looper letters, 13 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2021-03-26 10:28:38,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 123 flow [2021-03-26 10:28:38,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:28:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:28:38,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2021-03-26 10:28:38,561 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8860759493670886 [2021-03-26 10:28:38,561 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2021-03-26 10:28:38,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2021-03-26 10:28:38,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:38,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2021-03-26 10:28:38,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:38,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:38,577 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:38,578 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 420 transitions. [2021-03-26 10:28:38,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 123 flow [2021-03-26 10:28:38,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 42 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:28:38,581 INFO L241 Difference]: Finished difference. Result has 45 places, 36 transitions, 82 flow [2021-03-26 10:28:38,582 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2021-03-26 10:28:38,583 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-26 10:28:38,583 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:38,583 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 82 flow [2021-03-26 10:28:38,584 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 82 flow [2021-03-26 10:28:38,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 82 flow [2021-03-26 10:28:38,587 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-03-26 10:28:38,587 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:28:38,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:28:38,589 INFO L142 LiptonReduction]: Number of co-enabled transitions 360 [2021-03-26 10:28:38,831 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:28:38,939 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:28:39,243 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:28:39,537 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:28:40,113 WARN L205 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:28:40,640 WARN L205 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:28:41,260 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-03-26 10:28:41,538 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-03-26 10:28:42,099 WARN L205 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-03-26 10:28:42,702 WARN L205 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-03-26 10:28:43,094 INFO L154 LiptonReduction]: Checked pairs total: 1020 [2021-03-26 10:28:43,095 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 10:28:43,095 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4512 [2021-03-26 10:28:43,096 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2021-03-26 10:28:43,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:43,096 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:43,096 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:43,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:28:43,096 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:43,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:43,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1189168933, now seen corresponding path program 1 times [2021-03-26 10:28:43,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:43,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834122177] [2021-03-26 10:28:43,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:43,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:43,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:28:43,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:43,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:43,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:43,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:28:43,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:43,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:28:43,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:43,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:28:43,280 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:28:43,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:28:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:43,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834122177] [2021-03-26 10:28:43,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:43,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:28:43,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173456016] [2021-03-26 10:28:43,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:28:43,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:43,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:28:43,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:28:43,287 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 170 [2021-03-26 10:28:43,288 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:43,288 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:43,288 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 170 [2021-03-26 10:28:43,288 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:43,454 INFO L129 PetriNetUnfolder]: 280/508 cut-off events. [2021-03-26 10:28:43,454 INFO L130 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2021-03-26 10:28:43,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 508 events. 280/508 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2464 event pairs, 91 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 981. Up to 293 conditions per place. [2021-03-26 10:28:43,457 INFO L132 encePairwiseOnDemand]: 159/170 looper letters, 12 selfloop transitions, 12 changer transitions 21/57 dead transitions. [2021-03-26 10:28:43,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 57 transitions, 218 flow [2021-03-26 10:28:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:28:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:28:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 927 transitions. [2021-03-26 10:28:43,459 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7789915966386555 [2021-03-26 10:28:43,459 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 927 transitions. [2021-03-26 10:28:43,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 927 transitions. [2021-03-26 10:28:43,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:43,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 927 transitions. [2021-03-26 10:28:43,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.42857142857142) internal successors, (927), 7 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:43,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 170.0) internal successors, (1360), 8 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:43,463 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 170.0) internal successors, (1360), 8 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:43,463 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 7 states and 927 transitions. [2021-03-26 10:28:43,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 57 transitions, 218 flow [2021-03-26 10:28:43,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:28:43,465 INFO L241 Difference]: Finished difference. Result has 42 places, 33 transitions, 136 flow [2021-03-26 10:28:43,465 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2021-03-26 10:28:43,465 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2021-03-26 10:28:43,465 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:43,465 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 33 transitions, 136 flow [2021-03-26 10:28:43,466 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 136 flow [2021-03-26 10:28:43,466 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 136 flow [2021-03-26 10:28:43,484 INFO L129 PetriNetUnfolder]: 71/194 cut-off events. [2021-03-26 10:28:43,484 INFO L130 PetriNetUnfolder]: For 52/66 co-relation queries the response was YES. [2021-03-26 10:28:43,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 194 events. 71/194 cut-off events. For 52/66 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 978 event pairs, 36 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 433. Up to 101 conditions per place. [2021-03-26 10:28:43,486 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 10:28:43,947 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:28:44,062 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:28:44,312 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:28:44,429 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:28:44,437 INFO L154 LiptonReduction]: Checked pairs total: 330 [2021-03-26 10:28:44,437 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:28:44,437 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 972 [2021-03-26 10:28:44,438 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 130 flow [2021-03-26 10:28:44,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,439 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:44,439 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:44,439 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:28:44,439 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:44,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash 938806303, now seen corresponding path program 1 times [2021-03-26 10:28:44,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:44,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765586014] [2021-03-26 10:28:44,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:44,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:44,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:44,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765586014] [2021-03-26 10:28:44,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:44,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:28:44,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911310815] [2021-03-26 10:28:44,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:28:44,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:44,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:28:44,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:28:44,503 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 172 [2021-03-26 10:28:44,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:44,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 172 [2021-03-26 10:28:44,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:44,537 INFO L129 PetriNetUnfolder]: 119/278 cut-off events. [2021-03-26 10:28:44,538 INFO L130 PetriNetUnfolder]: For 141/144 co-relation queries the response was YES. [2021-03-26 10:28:44,538 INFO L84 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 278 events. 119/278 cut-off events. For 141/144 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1410 event pairs, 49 based on Foata normal form. 10/269 useless extension candidates. Maximal degree in co-relation 667. Up to 134 conditions per place. [2021-03-26 10:28:44,540 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 4 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2021-03-26 10:28:44,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 148 flow [2021-03-26 10:28:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:28:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:28:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2021-03-26 10:28:44,541 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8856589147286822 [2021-03-26 10:28:44,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2021-03-26 10:28:44,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2021-03-26 10:28:44,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:44,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2021-03-26 10:28:44,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,544 INFO L185 Difference]: Start difference. First operand has 35 places, 31 transitions, 130 flow. Second operand 3 states and 457 transitions. [2021-03-26 10:28:44,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 148 flow [2021-03-26 10:28:44,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 138 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-26 10:28:44,546 INFO L241 Difference]: Finished difference. Result has 36 places, 33 transitions, 141 flow [2021-03-26 10:28:44,546 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2021-03-26 10:28:44,546 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -12 predicate places. [2021-03-26 10:28:44,546 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:44,546 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 33 transitions, 141 flow [2021-03-26 10:28:44,547 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 33 transitions, 141 flow [2021-03-26 10:28:44,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 33 transitions, 141 flow [2021-03-26 10:28:44,611 INFO L129 PetriNetUnfolder]: 102/286 cut-off events. [2021-03-26 10:28:44,611 INFO L130 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2021-03-26 10:28:44,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 286 events. 102/286 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1689 event pairs, 39 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 609. Up to 121 conditions per place. [2021-03-26 10:28:44,613 INFO L142 LiptonReduction]: Number of co-enabled transitions 302 [2021-03-26 10:28:44,625 INFO L154 LiptonReduction]: Checked pairs total: 74 [2021-03-26 10:28:44,625 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:44,625 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 79 [2021-03-26 10:28:44,626 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 141 flow [2021-03-26 10:28:44,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:44,626 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:44,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:28:44,626 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:44,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:44,627 INFO L82 PathProgramCache]: Analyzing trace with hash -313318681, now seen corresponding path program 1 times [2021-03-26 10:28:44,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:44,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808842900] [2021-03-26 10:28:44,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:44,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:44,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:44,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808842900] [2021-03-26 10:28:44,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:44,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:28:44,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277816347] [2021-03-26 10:28:44,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:28:44,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:44,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:28:44,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:28:44,712 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 172 [2021-03-26 10:28:44,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,713 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:44,713 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 172 [2021-03-26 10:28:44,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:44,758 INFO L129 PetriNetUnfolder]: 102/250 cut-off events. [2021-03-26 10:28:44,758 INFO L130 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2021-03-26 10:28:44,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 250 events. 102/250 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1244 event pairs, 41 based on Foata normal form. 9/242 useless extension candidates. Maximal degree in co-relation 574. Up to 114 conditions per place. [2021-03-26 10:28:44,760 INFO L132 encePairwiseOnDemand]: 169/172 looper letters, 2 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2021-03-26 10:28:44,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 151 flow [2021-03-26 10:28:44,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:28:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:28:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-26 10:28:44,771 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8914728682170543 [2021-03-26 10:28:44,771 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-26 10:28:44,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-26 10:28:44,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:44,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-26 10:28:44,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,773 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,773 INFO L185 Difference]: Start difference. First operand has 36 places, 33 transitions, 141 flow. Second operand 3 states and 460 transitions. [2021-03-26 10:28:44,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 151 flow [2021-03-26 10:28:44,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:28:44,775 INFO L241 Difference]: Finished difference. Result has 38 places, 33 transitions, 151 flow [2021-03-26 10:28:44,775 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2021-03-26 10:28:44,775 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -10 predicate places. [2021-03-26 10:28:44,775 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:44,775 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 33 transitions, 151 flow [2021-03-26 10:28:44,775 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 33 transitions, 151 flow [2021-03-26 10:28:44,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 151 flow [2021-03-26 10:28:44,801 INFO L129 PetriNetUnfolder]: 96/240 cut-off events. [2021-03-26 10:28:44,802 INFO L130 PetriNetUnfolder]: For 136/145 co-relation queries the response was YES. [2021-03-26 10:28:44,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 240 events. 96/240 cut-off events. For 136/145 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1287 event pairs, 36 based on Foata normal form. 3/227 useless extension candidates. Maximal degree in co-relation 572. Up to 127 conditions per place. [2021-03-26 10:28:44,804 INFO L142 LiptonReduction]: Number of co-enabled transitions 302 [2021-03-26 10:28:44,841 INFO L154 LiptonReduction]: Checked pairs total: 65 [2021-03-26 10:28:44,841 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:44,842 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 67 [2021-03-26 10:28:44,843 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 151 flow [2021-03-26 10:28:44,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,843 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:44,843 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:44,843 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:28:44,843 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:44,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:44,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1122914113, now seen corresponding path program 1 times [2021-03-26 10:28:44,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:44,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372877915] [2021-03-26 10:28:44,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:44,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:44,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:44,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372877915] [2021-03-26 10:28:44,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:44,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:28:44,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759248271] [2021-03-26 10:28:44,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:28:44,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:44,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:28:44,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:28:44,935 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 172 [2021-03-26 10:28:44,935 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,935 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:44,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 172 [2021-03-26 10:28:44,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:44,962 INFO L129 PetriNetUnfolder]: 78/216 cut-off events. [2021-03-26 10:28:44,962 INFO L130 PetriNetUnfolder]: For 186/188 co-relation queries the response was YES. [2021-03-26 10:28:44,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 216 events. 78/216 cut-off events. For 186/188 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 32 based on Foata normal form. 11/212 useless extension candidates. Maximal degree in co-relation 502. Up to 90 conditions per place. [2021-03-26 10:28:44,963 INFO L132 encePairwiseOnDemand]: 169/172 looper letters, 2 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2021-03-26 10:28:44,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 161 flow [2021-03-26 10:28:44,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:28:44,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:28:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2021-03-26 10:28:44,965 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9031007751937985 [2021-03-26 10:28:44,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2021-03-26 10:28:44,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2021-03-26 10:28:44,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:44,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2021-03-26 10:28:44,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,967 INFO L185 Difference]: Start difference. First operand has 38 places, 33 transitions, 151 flow. Second operand 3 states and 466 transitions. [2021-03-26 10:28:44,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 161 flow [2021-03-26 10:28:44,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 155 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:28:44,969 INFO L241 Difference]: Finished difference. Result has 39 places, 33 transitions, 158 flow [2021-03-26 10:28:44,969 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2021-03-26 10:28:44,969 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -9 predicate places. [2021-03-26 10:28:44,969 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:44,969 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 158 flow [2021-03-26 10:28:44,969 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 33 transitions, 158 flow [2021-03-26 10:28:44,970 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 158 flow [2021-03-26 10:28:44,987 INFO L129 PetriNetUnfolder]: 72/197 cut-off events. [2021-03-26 10:28:44,987 INFO L130 PetriNetUnfolder]: For 120/130 co-relation queries the response was YES. [2021-03-26 10:28:44,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 197 events. 72/197 cut-off events. For 120/130 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 996 event pairs, 23 based on Foata normal form. 5/192 useless extension candidates. Maximal degree in co-relation 472. Up to 94 conditions per place. [2021-03-26 10:28:44,988 INFO L142 LiptonReduction]: Number of co-enabled transitions 302 [2021-03-26 10:28:44,991 INFO L154 LiptonReduction]: Checked pairs total: 78 [2021-03-26 10:28:44,991 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:44,991 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-26 10:28:44,993 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 158 flow [2021-03-26 10:28:44,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:44,993 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:44,993 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:44,993 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:28:44,993 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:44,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:44,999 INFO L82 PathProgramCache]: Analyzing trace with hash -451849680, now seen corresponding path program 1 times [2021-03-26 10:28:44,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:45,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814981693] [2021-03-26 10:28:45,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:45,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:45,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:28:45,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:45,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:28:45,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:45,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:45,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814981693] [2021-03-26 10:28:45,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:45,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:28:45,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241617936] [2021-03-26 10:28:45,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:28:45,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:45,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:28:45,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:28:45,113 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 172 [2021-03-26 10:28:45,114 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:45,114 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:45,114 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 172 [2021-03-26 10:28:45,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:45,230 INFO L129 PetriNetUnfolder]: 281/539 cut-off events. [2021-03-26 10:28:45,230 INFO L130 PetriNetUnfolder]: For 709/761 co-relation queries the response was YES. [2021-03-26 10:28:45,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 539 events. 281/539 cut-off events. For 709/761 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2938 event pairs, 52 based on Foata normal form. 28/544 useless extension candidates. Maximal degree in co-relation 1644. Up to 234 conditions per place. [2021-03-26 10:28:45,233 INFO L132 encePairwiseOnDemand]: 167/172 looper letters, 17 selfloop transitions, 5 changer transitions 9/44 dead transitions. [2021-03-26 10:28:45,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 262 flow [2021-03-26 10:28:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:28:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:28:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2021-03-26 10:28:45,235 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7747093023255814 [2021-03-26 10:28:45,235 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2021-03-26 10:28:45,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2021-03-26 10:28:45,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:45,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2021-03-26 10:28:45,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:45,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 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-03-26 10:28:45,237 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 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-03-26 10:28:45,237 INFO L185 Difference]: Start difference. First operand has 39 places, 33 transitions, 158 flow. Second operand 4 states and 533 transitions. [2021-03-26 10:28:45,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 262 flow [2021-03-26 10:28:45,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 246 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:28:45,239 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 145 flow [2021-03-26 10:28:45,240 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2021-03-26 10:28:45,240 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2021-03-26 10:28:45,240 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:45,240 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 145 flow [2021-03-26 10:28:45,240 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 145 flow [2021-03-26 10:28:45,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 145 flow [2021-03-26 10:28:45,257 INFO L129 PetriNetUnfolder]: 53/154 cut-off events. [2021-03-26 10:28:45,257 INFO L130 PetriNetUnfolder]: For 155/161 co-relation queries the response was YES. [2021-03-26 10:28:45,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 154 events. 53/154 cut-off events. For 155/161 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 759 event pairs, 25 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 404. Up to 77 conditions per place. [2021-03-26 10:28:45,259 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-26 10:28:45,261 INFO L154 LiptonReduction]: Checked pairs total: 71 [2021-03-26 10:28:45,261 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:45,261 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-26 10:28:45,261 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 145 flow [2021-03-26 10:28:45,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:45,262 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:45,262 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:45,262 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:28:45,262 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:45,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:45,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1389638538, now seen corresponding path program 1 times [2021-03-26 10:28:45,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:45,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135019522] [2021-03-26 10:28:45,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:45,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:45,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:28:45,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:45,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:45,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135019522] [2021-03-26 10:28:45,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:45,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:28:45,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958883553] [2021-03-26 10:28:45,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:28:45,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:45,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:28:45,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:28:45,316 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 172 [2021-03-26 10:28:45,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:45,317 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:45,317 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 172 [2021-03-26 10:28:45,317 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:45,348 INFO L129 PetriNetUnfolder]: 65/212 cut-off events. [2021-03-26 10:28:45,348 INFO L130 PetriNetUnfolder]: For 324/351 co-relation queries the response was YES. [2021-03-26 10:28:45,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 212 events. 65/212 cut-off events. For 324/351 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1210 event pairs, 29 based on Foata normal form. 6/197 useless extension candidates. Maximal degree in co-relation 514. Up to 95 conditions per place. [2021-03-26 10:28:45,349 INFO L132 encePairwiseOnDemand]: 169/172 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 10:28:45,349 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 157 flow [2021-03-26 10:28:45,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:28:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:28:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2021-03-26 10:28:45,351 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8837209302325582 [2021-03-26 10:28:45,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 456 transitions. [2021-03-26 10:28:45,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 456 transitions. [2021-03-26 10:28:45,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:45,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 456 transitions. [2021-03-26 10:28:45,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:45,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:45,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:45,353 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 145 flow. Second operand 3 states and 456 transitions. [2021-03-26 10:28:45,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 157 flow [2021-03-26 10:28:45,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 138 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-26 10:28:45,355 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 137 flow [2021-03-26 10:28:45,355 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-03-26 10:28:45,355 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2021-03-26 10:28:45,355 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:45,355 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 137 flow [2021-03-26 10:28:45,355 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 137 flow [2021-03-26 10:28:45,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 137 flow [2021-03-26 10:28:45,375 INFO L129 PetriNetUnfolder]: 63/203 cut-off events. [2021-03-26 10:28:45,375 INFO L130 PetriNetUnfolder]: For 139/159 co-relation queries the response was YES. [2021-03-26 10:28:45,375 INFO L84 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 203 events. 63/203 cut-off events. For 139/159 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1149 event pairs, 36 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 457. Up to 87 conditions per place. [2021-03-26 10:28:45,376 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-26 10:28:45,380 INFO L154 LiptonReduction]: Checked pairs total: 73 [2021-03-26 10:28:45,380 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:45,380 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-26 10:28:45,383 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 137 flow [2021-03-26 10:28:45,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:45,383 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:45,383 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:45,383 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:28:45,384 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:45,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:45,384 INFO L82 PathProgramCache]: Analyzing trace with hash -476322610, now seen corresponding path program 2 times [2021-03-26 10:28:45,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:45,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997185720] [2021-03-26 10:28:45,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:45,481 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-26 10:28:45,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 10:28:45,504 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 10:28:45,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 10:28:45,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:45,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:28:45,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:45,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:28:45,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:45,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:28:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:45,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997185720] [2021-03-26 10:28:45,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:45,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:28:45,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052338454] [2021-03-26 10:28:45,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:28:45,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:45,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:28:45,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:28:45,558 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 172 [2021-03-26 10:28:45,559 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 137 flow. Second operand has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:45,559 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:45,559 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 172 [2021-03-26 10:28:45,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:45,787 INFO L129 PetriNetUnfolder]: 295/592 cut-off events. [2021-03-26 10:28:45,787 INFO L130 PetriNetUnfolder]: For 823/907 co-relation queries the response was YES. [2021-03-26 10:28:45,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 592 events. 295/592 cut-off events. For 823/907 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3446 event pairs, 86 based on Foata normal form. 35/604 useless extension candidates. Maximal degree in co-relation 1747. Up to 289 conditions per place. [2021-03-26 10:28:45,790 INFO L132 encePairwiseOnDemand]: 164/172 looper letters, 15 selfloop transitions, 15 changer transitions 2/45 dead transitions. [2021-03-26 10:28:45,790 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 273 flow [2021-03-26 10:28:45,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:28:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:28:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 768 transitions. [2021-03-26 10:28:45,793 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2021-03-26 10:28:45,793 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 768 transitions. [2021-03-26 10:28:45,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 768 transitions. [2021-03-26 10:28:45,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:45,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 768 transitions. [2021-03-26 10:28:45,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:45,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:45,796 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:45,796 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 137 flow. Second operand 6 states and 768 transitions. [2021-03-26 10:28:45,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 273 flow [2021-03-26 10:28:45,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 268 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:28:45,799 INFO L241 Difference]: Finished difference. Result has 47 places, 37 transitions, 240 flow [2021-03-26 10:28:45,799 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2021-03-26 10:28:45,799 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2021-03-26 10:28:45,799 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:45,800 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 37 transitions, 240 flow [2021-03-26 10:28:45,800 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 240 flow [2021-03-26 10:28:45,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 240 flow [2021-03-26 10:28:45,828 INFO L129 PetriNetUnfolder]: 94/266 cut-off events. [2021-03-26 10:28:45,828 INFO L130 PetriNetUnfolder]: For 473/496 co-relation queries the response was YES. [2021-03-26 10:28:45,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 266 events. 94/266 cut-off events. For 473/496 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1505 event pairs, 18 based on Foata normal form. 6/251 useless extension candidates. Maximal degree in co-relation 870. Up to 126 conditions per place. [2021-03-26 10:28:45,830 INFO L142 LiptonReduction]: Number of co-enabled transitions 306 [2021-03-26 10:28:45,851 INFO L154 LiptonReduction]: Checked pairs total: 74 [2021-03-26 10:28:45,852 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:45,852 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-03-26 10:28:45,852 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 240 flow [2021-03-26 10:28:45,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:45,852 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:45,853 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:45,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:28:45,853 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:45,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:45,853 INFO L82 PathProgramCache]: Analyzing trace with hash -899264680, now seen corresponding path program 3 times [2021-03-26 10:28:45,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:45,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114347883] [2021-03-26 10:28:45,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:45,931 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-26 10:28:45,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 10:28:45,950 INFO L142 QuantifierPusher]: treesize reduction 11, result has 86.4 percent of original size [2021-03-26 10:28:45,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-03-26 10:28:45,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:45,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:45,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:45,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114347883] [2021-03-26 10:28:45,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:45,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:28:45,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757753745] [2021-03-26 10:28:45,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:28:45,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:45,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:28:45,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:28:45,981 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 172 [2021-03-26 10:28:45,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:45,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:45,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 172 [2021-03-26 10:28:45,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:46,117 INFO L129 PetriNetUnfolder]: 279/575 cut-off events. [2021-03-26 10:28:46,118 INFO L130 PetriNetUnfolder]: For 1558/1669 co-relation queries the response was YES. [2021-03-26 10:28:46,119 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2239 conditions, 575 events. 279/575 cut-off events. For 1558/1669 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3403 event pairs, 88 based on Foata normal form. 49/610 useless extension candidates. Maximal degree in co-relation 2219. Up to 274 conditions per place. [2021-03-26 10:28:46,121 INFO L132 encePairwiseOnDemand]: 165/172 looper letters, 21 selfloop transitions, 9 changer transitions 6/49 dead transitions. [2021-03-26 10:28:46,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 396 flow [2021-03-26 10:28:46,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:28:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:28:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2021-03-26 10:28:46,123 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7383720930232558 [2021-03-26 10:28:46,123 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2021-03-26 10:28:46,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2021-03-26 10:28:46,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:46,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2021-03-26 10:28:46,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:46,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:46,125 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:46,125 INFO L185 Difference]: Start difference. First operand has 47 places, 37 transitions, 240 flow. Second operand 5 states and 635 transitions. [2021-03-26 10:28:46,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 396 flow [2021-03-26 10:28:46,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 362 flow, removed 13 selfloop flow, removed 2 redundant places. [2021-03-26 10:28:46,129 INFO L241 Difference]: Finished difference. Result has 51 places, 36 transitions, 246 flow [2021-03-26 10:28:46,129 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2021-03-26 10:28:46,129 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2021-03-26 10:28:46,129 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:46,129 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 36 transitions, 246 flow [2021-03-26 10:28:46,130 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 36 transitions, 246 flow [2021-03-26 10:28:46,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 36 transitions, 246 flow [2021-03-26 10:28:46,149 INFO L129 PetriNetUnfolder]: 61/188 cut-off events. [2021-03-26 10:28:46,149 INFO L130 PetriNetUnfolder]: For 431/446 co-relation queries the response was YES. [2021-03-26 10:28:46,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 188 events. 61/188 cut-off events. For 431/446 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1001 event pairs, 15 based on Foata normal form. 6/187 useless extension candidates. Maximal degree in co-relation 649. Up to 84 conditions per place. [2021-03-26 10:28:46,151 INFO L142 LiptonReduction]: Number of co-enabled transitions 270 [2021-03-26 10:28:46,185 INFO L154 LiptonReduction]: Checked pairs total: 143 [2021-03-26 10:28:46,185 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:46,185 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-03-26 10:28:46,186 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 246 flow [2021-03-26 10:28:46,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:46,186 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:46,186 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:46,186 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:28:46,186 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:46,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:46,186 INFO L82 PathProgramCache]: Analyzing trace with hash -152123389, now seen corresponding path program 1 times [2021-03-26 10:28:46,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:46,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792696239] [2021-03-26 10:28:46,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:46,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:46,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:28:46,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:46,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:28:46,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:46,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:28:46,281 INFO L142 QuantifierPusher]: treesize reduction 48, result has 40.7 percent of original size [2021-03-26 10:28:46,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 10:28:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:46,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792696239] [2021-03-26 10:28:46,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:46,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:28:46,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539853778] [2021-03-26 10:28:46,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:28:46,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:46,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:28:46,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:28:46,311 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 172 [2021-03-26 10:28:46,312 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:46,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:46,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 172 [2021-03-26 10:28:46,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:46,458 INFO L129 PetriNetUnfolder]: 204/429 cut-off events. [2021-03-26 10:28:46,458 INFO L130 PetriNetUnfolder]: For 1269/1334 co-relation queries the response was YES. [2021-03-26 10:28:46,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 429 events. 204/429 cut-off events. For 1269/1334 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2307 event pairs, 90 based on Foata normal form. 20/444 useless extension candidates. Maximal degree in co-relation 1637. Up to 295 conditions per place. [2021-03-26 10:28:46,461 INFO L132 encePairwiseOnDemand]: 163/172 looper letters, 25 selfloop transitions, 15 changer transitions 0/53 dead transitions. [2021-03-26 10:28:46,461 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 435 flow [2021-03-26 10:28:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:28:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:28:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2021-03-26 10:28:46,463 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7546511627906977 [2021-03-26 10:28:46,463 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2021-03-26 10:28:46,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2021-03-26 10:28:46,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:46,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2021-03-26 10:28:46,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:46,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:46,466 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:46,466 INFO L185 Difference]: Start difference. First operand has 51 places, 36 transitions, 246 flow. Second operand 5 states and 649 transitions. [2021-03-26 10:28:46,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 435 flow [2021-03-26 10:28:46,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 388 flow, removed 5 selfloop flow, removed 6 redundant places. [2021-03-26 10:28:46,469 INFO L241 Difference]: Finished difference. Result has 52 places, 48 transitions, 351 flow [2021-03-26 10:28:46,469 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=351, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2021-03-26 10:28:46,469 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2021-03-26 10:28:46,469 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:46,469 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 48 transitions, 351 flow [2021-03-26 10:28:46,470 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 48 transitions, 351 flow [2021-03-26 10:28:46,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 48 transitions, 351 flow [2021-03-26 10:28:46,509 INFO L129 PetriNetUnfolder]: 160/368 cut-off events. [2021-03-26 10:28:46,509 INFO L130 PetriNetUnfolder]: For 1018/1077 co-relation queries the response was YES. [2021-03-26 10:28:46,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 368 events. 160/368 cut-off events. For 1018/1077 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2085 event pairs, 43 based on Foata normal form. 6/348 useless extension candidates. Maximal degree in co-relation 1453. Up to 158 conditions per place. [2021-03-26 10:28:46,512 INFO L142 LiptonReduction]: Number of co-enabled transitions 288 [2021-03-26 10:28:47,113 WARN L205 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-26 10:28:47,321 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 10:28:48,533 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 339 DAG size of output: 260 [2021-03-26 10:28:48,946 WARN L205 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-26 10:28:48,956 INFO L154 LiptonReduction]: Checked pairs total: 209 [2021-03-26 10:28:48,956 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:28:48,956 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2487 [2021-03-26 10:28:48,956 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 361 flow [2021-03-26 10:28:48,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:48,957 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:48,957 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:48,957 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:28:48,957 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:48,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:48,957 INFO L82 PathProgramCache]: Analyzing trace with hash -175484989, now seen corresponding path program 2 times [2021-03-26 10:28:48,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:48,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116122194] [2021-03-26 10:28:48,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:49,009 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.1 percent of original size [2021-03-26 10:28:49,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-26 10:28:49,040 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.3 percent of original size [2021-03-26 10:28:49,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 71 [2021-03-26 10:28:49,076 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.1 percent of original size [2021-03-26 10:28:49,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-26 10:28:49,109 INFO L142 QuantifierPusher]: treesize reduction 10, result has 88.0 percent of original size [2021-03-26 10:28:49,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 73 [2021-03-26 10:28:49,147 INFO L142 QuantifierPusher]: treesize reduction 8, result has 65.2 percent of original size [2021-03-26 10:28:49,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:28:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:49,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116122194] [2021-03-26 10:28:49,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:49,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:28:49,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759722017] [2021-03-26 10:28:49,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:28:49,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:49,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:28:49,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:28:49,160 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 173 [2021-03-26 10:28:49,160 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 361 flow. Second operand has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:49,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:49,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 173 [2021-03-26 10:28:49,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:49,374 INFO L129 PetriNetUnfolder]: 201/422 cut-off events. [2021-03-26 10:28:49,374 INFO L130 PetriNetUnfolder]: For 1458/1551 co-relation queries the response was YES. [2021-03-26 10:28:49,375 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1993 conditions, 422 events. 201/422 cut-off events. For 1458/1551 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2253 event pairs, 82 based on Foata normal form. 30/448 useless extension candidates. Maximal degree in co-relation 1970. Up to 295 conditions per place. [2021-03-26 10:28:49,376 INFO L132 encePairwiseOnDemand]: 165/173 looper letters, 31 selfloop transitions, 24 changer transitions 0/68 dead transitions. [2021-03-26 10:28:49,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 640 flow [2021-03-26 10:28:49,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:28:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:28:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2021-03-26 10:28:49,379 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7445086705202312 [2021-03-26 10:28:49,379 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2021-03-26 10:28:49,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2021-03-26 10:28:49,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:49,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2021-03-26 10:28:49,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:49,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:49,381 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:49,381 INFO L185 Difference]: Start difference. First operand has 52 places, 48 transitions, 361 flow. Second operand 5 states and 644 transitions. [2021-03-26 10:28:49,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 640 flow [2021-03-26 10:28:49,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 621 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-26 10:28:49,385 INFO L241 Difference]: Finished difference. Result has 58 places, 59 transitions, 518 flow [2021-03-26 10:28:49,385 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=518, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2021-03-26 10:28:49,385 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2021-03-26 10:28:49,385 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:49,385 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 59 transitions, 518 flow [2021-03-26 10:28:49,385 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 59 transitions, 518 flow [2021-03-26 10:28:49,386 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 59 transitions, 518 flow [2021-03-26 10:28:49,423 INFO L129 PetriNetUnfolder]: 160/369 cut-off events. [2021-03-26 10:28:49,423 INFO L130 PetriNetUnfolder]: For 1529/1609 co-relation queries the response was YES. [2021-03-26 10:28:49,424 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1697 conditions, 369 events. 160/369 cut-off events. For 1529/1609 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2112 event pairs, 69 based on Foata normal form. 5/348 useless extension candidates. Maximal degree in co-relation 1672. Up to 155 conditions per place. [2021-03-26 10:28:49,426 INFO L142 LiptonReduction]: Number of co-enabled transitions 316 [2021-03-26 10:28:49,436 INFO L154 LiptonReduction]: Checked pairs total: 157 [2021-03-26 10:28:49,436 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:49,437 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 52 [2021-03-26 10:28:49,439 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 518 flow [2021-03-26 10:28:49,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:49,439 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:49,439 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:49,440 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:28:49,440 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:49,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:49,440 INFO L82 PathProgramCache]: Analyzing trace with hash -771884638, now seen corresponding path program 1 times [2021-03-26 10:28:49,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:49,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238474712] [2021-03-26 10:28:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:49,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:49,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:28:49,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:49,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:28:49,531 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.1 percent of original size [2021-03-26 10:28:49,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-03-26 10:28:49,561 INFO L142 QuantifierPusher]: treesize reduction 6, result has 92.3 percent of original size [2021-03-26 10:28:49,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 72 [2021-03-26 10:28:49,595 INFO L142 QuantifierPusher]: treesize reduction 7, result has 91.8 percent of original size [2021-03-26 10:28:49,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-03-26 10:28:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:49,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238474712] [2021-03-26 10:28:49,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:49,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:28:49,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90114450] [2021-03-26 10:28:49,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:28:49,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:49,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:28:49,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:28:49,630 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 173 [2021-03-26 10:28:49,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 518 flow. Second operand has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:49,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:49,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 173 [2021-03-26 10:28:49,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:49,832 INFO L129 PetriNetUnfolder]: 234/488 cut-off events. [2021-03-26 10:28:49,832 INFO L130 PetriNetUnfolder]: For 2343/2437 co-relation queries the response was YES. [2021-03-26 10:28:49,833 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2615 conditions, 488 events. 234/488 cut-off events. For 2343/2437 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2706 event pairs, 44 based on Foata normal form. 46/529 useless extension candidates. Maximal degree in co-relation 2588. Up to 263 conditions per place. [2021-03-26 10:28:49,836 INFO L132 encePairwiseOnDemand]: 164/173 looper letters, 32 selfloop transitions, 27 changer transitions 0/72 dead transitions. [2021-03-26 10:28:49,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 776 flow [2021-03-26 10:28:49,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:28:49,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:28:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 747 transitions. [2021-03-26 10:28:49,838 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7196531791907514 [2021-03-26 10:28:49,838 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 747 transitions. [2021-03-26 10:28:49,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 747 transitions. [2021-03-26 10:28:49,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:49,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 747 transitions. [2021-03-26 10:28:49,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:49,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:49,841 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:49,841 INFO L185 Difference]: Start difference. First operand has 58 places, 59 transitions, 518 flow. Second operand 6 states and 747 transitions. [2021-03-26 10:28:49,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 776 flow [2021-03-26 10:28:49,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 757 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-26 10:28:49,847 INFO L241 Difference]: Finished difference. Result has 64 places, 65 transitions, 662 flow [2021-03-26 10:28:49,847 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=662, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2021-03-26 10:28:49,847 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2021-03-26 10:28:49,847 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:49,847 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 65 transitions, 662 flow [2021-03-26 10:28:49,847 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 65 transitions, 662 flow [2021-03-26 10:28:49,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 65 transitions, 662 flow [2021-03-26 10:28:49,898 INFO L129 PetriNetUnfolder]: 231/503 cut-off events. [2021-03-26 10:28:49,898 INFO L130 PetriNetUnfolder]: For 2721/2744 co-relation queries the response was YES. [2021-03-26 10:28:49,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2617 conditions, 503 events. 231/503 cut-off events. For 2721/2744 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2948 event pairs, 16 based on Foata normal form. 8/505 useless extension candidates. Maximal degree in co-relation 2589. Up to 219 conditions per place. [2021-03-26 10:28:49,902 INFO L142 LiptonReduction]: Number of co-enabled transitions 330 [2021-03-26 10:28:50,512 WARN L205 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-26 10:28:50,713 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 10:28:52,039 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 339 DAG size of output: 260 [2021-03-26 10:28:52,504 WARN L205 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-26 10:28:52,525 INFO L154 LiptonReduction]: Checked pairs total: 401 [2021-03-26 10:28:52,525 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:28:52,525 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2678 [2021-03-26 10:28:52,526 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 676 flow [2021-03-26 10:28:52,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:52,526 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:52,526 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:52,526 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:28:52,526 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:52,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:52,527 INFO L82 PathProgramCache]: Analyzing trace with hash 979725368, now seen corresponding path program 2 times [2021-03-26 10:28:52,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:52,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658288622] [2021-03-26 10:28:52,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:52,604 INFO L142 QuantifierPusher]: treesize reduction 31, result has 63.5 percent of original size [2021-03-26 10:28:52,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-26 10:28:52,656 INFO L142 QuantifierPusher]: treesize reduction 31, result has 64.8 percent of original size [2021-03-26 10:28:52,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-03-26 10:28:52,707 INFO L142 QuantifierPusher]: treesize reduction 35, result has 83.1 percent of original size [2021-03-26 10:28:52,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 172 [2021-03-26 10:28:52,812 INFO L142 QuantifierPusher]: treesize reduction 38, result has 69.6 percent of original size [2021-03-26 10:28:52,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 87 [2021-03-26 10:28:52,872 INFO L142 QuantifierPusher]: treesize reduction 6, result has 89.7 percent of original size [2021-03-26 10:28:52,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-26 10:28:52,911 INFO L142 QuantifierPusher]: treesize reduction 32, result has 69.5 percent of original size [2021-03-26 10:28:52,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 73 [2021-03-26 10:28:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:52,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658288622] [2021-03-26 10:28:52,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:52,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:28:52,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959602113] [2021-03-26 10:28:52,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:28:52,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:52,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:28:52,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:28:52,956 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 174 [2021-03-26 10:28:52,956 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 676 flow. Second operand has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:52,956 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:52,956 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 174 [2021-03-26 10:28:52,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:53,391 INFO L129 PetriNetUnfolder]: 191/469 cut-off events. [2021-03-26 10:28:53,391 INFO L130 PetriNetUnfolder]: For 3519/3602 co-relation queries the response was YES. [2021-03-26 10:28:53,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2900 conditions, 469 events. 191/469 cut-off events. For 3519/3602 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2836 event pairs, 16 based on Foata normal form. 56/521 useless extension candidates. Maximal degree in co-relation 2870. Up to 300 conditions per place. [2021-03-26 10:28:53,395 INFO L132 encePairwiseOnDemand]: 163/174 looper letters, 36 selfloop transitions, 33 changer transitions 4/86 dead transitions. [2021-03-26 10:28:53,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 86 transitions, 1082 flow [2021-03-26 10:28:53,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:28:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:28:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 973 transitions. [2021-03-26 10:28:53,397 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6989942528735632 [2021-03-26 10:28:53,397 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 973 transitions. [2021-03-26 10:28:53,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 973 transitions. [2021-03-26 10:28:53,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:53,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 973 transitions. [2021-03-26 10:28:53,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.625) internal successors, (973), 8 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:53,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 174.0) internal successors, (1566), 9 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:53,400 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 174.0) internal successors, (1566), 9 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:53,401 INFO L185 Difference]: Start difference. First operand has 64 places, 65 transitions, 676 flow. Second operand 8 states and 973 transitions. [2021-03-26 10:28:53,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 86 transitions, 1082 flow [2021-03-26 10:28:53,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 86 transitions, 1042 flow, removed 17 selfloop flow, removed 2 redundant places. [2021-03-26 10:28:53,409 INFO L241 Difference]: Finished difference. Result has 73 places, 74 transitions, 871 flow [2021-03-26 10:28:53,409 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=871, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2021-03-26 10:28:53,409 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 25 predicate places. [2021-03-26 10:28:53,409 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:53,409 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 74 transitions, 871 flow [2021-03-26 10:28:53,410 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 74 transitions, 871 flow [2021-03-26 10:28:53,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 74 transitions, 871 flow [2021-03-26 10:28:53,494 INFO L129 PetriNetUnfolder]: 186/460 cut-off events. [2021-03-26 10:28:53,494 INFO L130 PetriNetUnfolder]: For 4188/4212 co-relation queries the response was YES. [2021-03-26 10:28:53,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2608 conditions, 460 events. 186/460 cut-off events. For 4188/4212 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2799 event pairs, 10 based on Foata normal form. 14/470 useless extension candidates. Maximal degree in co-relation 2576. Up to 227 conditions per place. [2021-03-26 10:28:53,498 INFO L142 LiptonReduction]: Number of co-enabled transitions 358 [2021-03-26 10:28:53,515 INFO L154 LiptonReduction]: Checked pairs total: 252 [2021-03-26 10:28:53,515 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:53,515 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 106 [2021-03-26 10:28:53,517 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 871 flow [2021-03-26 10:28:53,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:53,517 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:53,517 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:53,517 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:28:53,517 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:53,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:53,518 INFO L82 PathProgramCache]: Analyzing trace with hash -763775522, now seen corresponding path program 1 times [2021-03-26 10:28:53,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:53,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091341886] [2021-03-26 10:28:53,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:53,590 INFO L142 QuantifierPusher]: treesize reduction 3, result has 96.9 percent of original size [2021-03-26 10:28:53,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-03-26 10:28:53,636 INFO L142 QuantifierPusher]: treesize reduction 3, result has 97.0 percent of original size [2021-03-26 10:28:53,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 97 [2021-03-26 10:28:53,687 INFO L142 QuantifierPusher]: treesize reduction 11, result has 89.5 percent of original size [2021-03-26 10:28:53,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-03-26 10:28:53,733 INFO L142 QuantifierPusher]: treesize reduction 15, result has 86.8 percent of original size [2021-03-26 10:28:53,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 99 [2021-03-26 10:28:53,784 INFO L142 QuantifierPusher]: treesize reduction 70, result has 53.3 percent of original size [2021-03-26 10:28:53,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2021-03-26 10:28:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:53,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091341886] [2021-03-26 10:28:53,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:53,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:28:53,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364596518] [2021-03-26 10:28:53,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:28:53,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:53,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:28:53,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:28:53,823 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 174 [2021-03-26 10:28:53,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 871 flow. Second operand has 7 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 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-03-26 10:28:53,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:53,824 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 174 [2021-03-26 10:28:53,824 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:54,048 INFO L129 PetriNetUnfolder]: 195/478 cut-off events. [2021-03-26 10:28:54,048 INFO L130 PetriNetUnfolder]: For 4364/4460 co-relation queries the response was YES. [2021-03-26 10:28:54,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3070 conditions, 478 events. 195/478 cut-off events. For 4364/4460 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2895 event pairs, 14 based on Foata normal form. 62/536 useless extension candidates. Maximal degree in co-relation 3036. Up to 294 conditions per place. [2021-03-26 10:28:54,051 INFO L132 encePairwiseOnDemand]: 165/174 looper letters, 39 selfloop transitions, 36 changer transitions 3/91 dead transitions. [2021-03-26 10:28:54,051 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 91 transitions, 1266 flow [2021-03-26 10:28:54,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:28:54,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:28:54,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 894 transitions. [2021-03-26 10:28:54,054 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7339901477832512 [2021-03-26 10:28:54,054 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 894 transitions. [2021-03-26 10:28:54,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 894 transitions. [2021-03-26 10:28:54,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:54,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 894 transitions. [2021-03-26 10:28:54,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.71428571428571) internal successors, (894), 7 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:54,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:54,057 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:54,057 INFO L185 Difference]: Start difference. First operand has 73 places, 74 transitions, 871 flow. Second operand 7 states and 894 transitions. [2021-03-26 10:28:54,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 91 transitions, 1266 flow [2021-03-26 10:28:54,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 1182 flow, removed 25 selfloop flow, removed 4 redundant places. [2021-03-26 10:28:54,065 INFO L241 Difference]: Finished difference. Result has 78 places, 82 transitions, 1051 flow [2021-03-26 10:28:54,065 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1051, PETRI_PLACES=78, PETRI_TRANSITIONS=82} [2021-03-26 10:28:54,065 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 30 predicate places. [2021-03-26 10:28:54,065 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:54,065 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 82 transitions, 1051 flow [2021-03-26 10:28:54,065 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 82 transitions, 1051 flow [2021-03-26 10:28:54,066 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 82 transitions, 1051 flow [2021-03-26 10:28:54,118 INFO L129 PetriNetUnfolder]: 187/474 cut-off events. [2021-03-26 10:28:54,118 INFO L130 PetriNetUnfolder]: For 5349/5385 co-relation queries the response was YES. [2021-03-26 10:28:54,119 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2937 conditions, 474 events. 187/474 cut-off events. For 5349/5385 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2921 event pairs, 12 based on Foata normal form. 13/483 useless extension candidates. Maximal degree in co-relation 2903. Up to 234 conditions per place. [2021-03-26 10:28:54,122 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-26 10:28:54,136 INFO L154 LiptonReduction]: Checked pairs total: 304 [2021-03-26 10:28:54,137 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:54,137 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 72 [2021-03-26 10:28:54,137 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 82 transitions, 1051 flow [2021-03-26 10:28:54,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 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-03-26 10:28:54,138 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:54,138 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:54,138 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:28:54,138 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:54,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:54,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1391740073, now seen corresponding path program 1 times [2021-03-26 10:28:54,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:54,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233497180] [2021-03-26 10:28:54,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:54,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:54,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:54,190 INFO L142 QuantifierPusher]: treesize reduction 12, result has 60.0 percent of original size [2021-03-26 10:28:54,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:28:54,200 INFO L142 QuantifierPusher]: treesize reduction 78, result has 39.1 percent of original size [2021-03-26 10:28:54,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 10:28:54,222 INFO L142 QuantifierPusher]: treesize reduction 5, result has 87.2 percent of original size [2021-03-26 10:28:54,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-26 10:28:54,241 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-26 10:28:54,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:28:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:54,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233497180] [2021-03-26 10:28:54,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:54,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:28:54,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256899284] [2021-03-26 10:28:54,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:28:54,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:54,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:28:54,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:28:54,249 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 174 [2021-03-26 10:28:54,249 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 82 transitions, 1051 flow. Second operand has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 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-03-26 10:28:54,249 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:54,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 174 [2021-03-26 10:28:54,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:54,614 INFO L129 PetriNetUnfolder]: 223/710 cut-off events. [2021-03-26 10:28:54,614 INFO L130 PetriNetUnfolder]: For 8393/8475 co-relation queries the response was YES. [2021-03-26 10:28:54,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4625 conditions, 710 events. 223/710 cut-off events. For 8393/8475 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5514 event pairs, 6 based on Foata normal form. 62/768 useless extension candidates. Maximal degree in co-relation 4589. Up to 346 conditions per place. [2021-03-26 10:28:54,618 INFO L132 encePairwiseOnDemand]: 163/174 looper letters, 44 selfloop transitions, 40 changer transitions 33/130 dead transitions. [2021-03-26 10:28:54,619 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 130 transitions, 1989 flow [2021-03-26 10:28:54,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-26 10:28:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-26 10:28:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1536 transitions. [2021-03-26 10:28:54,623 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.735632183908046 [2021-03-26 10:28:54,623 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1536 transitions. [2021-03-26 10:28:54,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1536 transitions. [2021-03-26 10:28:54,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:54,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1536 transitions. [2021-03-26 10:28:54,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 128.0) internal successors, (1536), 12 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:54,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 174.0) internal successors, (2262), 13 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:54,628 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 174.0) internal successors, (2262), 13 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:54,628 INFO L185 Difference]: Start difference. First operand has 78 places, 82 transitions, 1051 flow. Second operand 12 states and 1536 transitions. [2021-03-26 10:28:54,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 130 transitions, 1989 flow [2021-03-26 10:28:54,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 130 transitions, 1902 flow, removed 33 selfloop flow, removed 2 redundant places. [2021-03-26 10:28:54,647 INFO L241 Difference]: Finished difference. Result has 95 places, 93 transitions, 1355 flow [2021-03-26 10:28:54,647 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1355, PETRI_PLACES=95, PETRI_TRANSITIONS=93} [2021-03-26 10:28:54,647 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 47 predicate places. [2021-03-26 10:28:54,647 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:54,648 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 93 transitions, 1355 flow [2021-03-26 10:28:54,648 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 93 transitions, 1355 flow [2021-03-26 10:28:54,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 94 places, 93 transitions, 1355 flow [2021-03-26 10:28:54,742 INFO L129 PetriNetUnfolder]: 167/477 cut-off events. [2021-03-26 10:28:54,743 INFO L130 PetriNetUnfolder]: For 7881/7904 co-relation queries the response was YES. [2021-03-26 10:28:54,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3408 conditions, 477 events. 167/477 cut-off events. For 7881/7904 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3180 event pairs, 9 based on Foata normal form. 9/482 useless extension candidates. Maximal degree in co-relation 3365. Up to 222 conditions per place. [2021-03-26 10:28:54,749 INFO L142 LiptonReduction]: Number of co-enabled transitions 422 [2021-03-26 10:28:54,774 INFO L154 LiptonReduction]: Checked pairs total: 523 [2021-03-26 10:28:54,774 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:54,774 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 127 [2021-03-26 10:28:54,777 INFO L480 AbstractCegarLoop]: Abstraction has has 94 places, 93 transitions, 1355 flow [2021-03-26 10:28:54,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 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-03-26 10:28:54,777 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:54,777 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:54,777 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 10:28:54,777 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:54,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:54,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1197834969, now seen corresponding path program 1 times [2021-03-26 10:28:54,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:54,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167359051] [2021-03-26 10:28:54,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:54,882 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.4 percent of original size [2021-03-26 10:28:54,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-03-26 10:28:54,928 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.5 percent of original size [2021-03-26 10:28:54,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 77 [2021-03-26 10:28:54,977 INFO L142 QuantifierPusher]: treesize reduction 179, result has 40.3 percent of original size [2021-03-26 10:28:54,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 121 [2021-03-26 10:28:54,989 INFO L142 QuantifierPusher]: treesize reduction 87, result has 71.7 percent of original size [2021-03-26 10:28:54,991 INFO L147 QuantifierPusher]: treesize reduction 36, result has 83.6 percent of original size 184 [2021-03-26 10:28:55,074 INFO L142 QuantifierPusher]: treesize reduction 11, result has 87.1 percent of original size [2021-03-26 10:28:55,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-03-26 10:28:55,118 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.8 percent of original size [2021-03-26 10:28:55,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 10:28:55,148 INFO L142 QuantifierPusher]: treesize reduction 34, result has 75.4 percent of original size [2021-03-26 10:28:55,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2021-03-26 10:28:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:55,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167359051] [2021-03-26 10:28:55,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:55,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:28:55,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407352681] [2021-03-26 10:28:55,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:28:55,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:55,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:28:55,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:28:55,193 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 174 [2021-03-26 10:28:55,194 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 93 transitions, 1355 flow. Second operand has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:55,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:55,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 174 [2021-03-26 10:28:55,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:55,461 INFO L129 PetriNetUnfolder]: 164/468 cut-off events. [2021-03-26 10:28:55,462 INFO L130 PetriNetUnfolder]: For 8022/8095 co-relation queries the response was YES. [2021-03-26 10:28:55,463 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3659 conditions, 468 events. 164/468 cut-off events. For 8022/8095 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3088 event pairs, 13 based on Foata normal form. 24/488 useless extension candidates. Maximal degree in co-relation 3614. Up to 302 conditions per place. [2021-03-26 10:28:55,466 INFO L132 encePairwiseOnDemand]: 165/174 looper letters, 51 selfloop transitions, 26 changer transitions 4/94 dead transitions. [2021-03-26 10:28:55,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 1483 flow [2021-03-26 10:28:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:28:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:28:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2021-03-26 10:28:55,468 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7059386973180076 [2021-03-26 10:28:55,468 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2021-03-26 10:28:55,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2021-03-26 10:28:55,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:55,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2021-03-26 10:28:55,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:55,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:55,471 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:55,471 INFO L185 Difference]: Start difference. First operand has 94 places, 93 transitions, 1355 flow. Second operand 6 states and 737 transitions. [2021-03-26 10:28:55,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 94 transitions, 1483 flow [2021-03-26 10:28:55,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 94 transitions, 1386 flow, removed 38 selfloop flow, removed 3 redundant places. [2021-03-26 10:28:55,487 INFO L241 Difference]: Finished difference. Result has 98 places, 89 transitions, 1245 flow [2021-03-26 10:28:55,487 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1245, PETRI_PLACES=98, PETRI_TRANSITIONS=89} [2021-03-26 10:28:55,487 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 50 predicate places. [2021-03-26 10:28:55,487 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:55,488 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 89 transitions, 1245 flow [2021-03-26 10:28:55,488 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 89 transitions, 1245 flow [2021-03-26 10:28:55,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 97 places, 89 transitions, 1245 flow [2021-03-26 10:28:55,541 INFO L129 PetriNetUnfolder]: 162/453 cut-off events. [2021-03-26 10:28:55,541 INFO L130 PetriNetUnfolder]: For 6998/7028 co-relation queries the response was YES. [2021-03-26 10:28:55,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3042 conditions, 453 events. 162/453 cut-off events. For 6998/7028 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2989 event pairs, 4 based on Foata normal form. 11/460 useless extension candidates. Maximal degree in co-relation 2998. Up to 197 conditions per place. [2021-03-26 10:28:55,546 INFO L142 LiptonReduction]: Number of co-enabled transitions 402 [2021-03-26 10:28:55,562 INFO L154 LiptonReduction]: Checked pairs total: 547 [2021-03-26 10:28:55,562 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:55,562 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 75 [2021-03-26 10:28:55,563 INFO L480 AbstractCegarLoop]: Abstraction has has 97 places, 89 transitions, 1245 flow [2021-03-26 10:28:55,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:55,569 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:55,573 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:55,573 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 10:28:55,573 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:55,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:55,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1281671751, now seen corresponding path program 1 times [2021-03-26 10:28:55,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:55,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174914741] [2021-03-26 10:28:55,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:55,638 INFO L142 QuantifierPusher]: treesize reduction 30, result has 25.0 percent of original size [2021-03-26 10:28:55,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:28:55,645 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.0 percent of original size [2021-03-26 10:28:55,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-03-26 10:28:55,693 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.1 percent of original size [2021-03-26 10:28:55,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-26 10:28:55,748 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.3 percent of original size [2021-03-26 10:28:55,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 72 [2021-03-26 10:28:55,809 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.5 percent of original size [2021-03-26 10:28:55,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-03-26 10:28:55,882 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.3 percent of original size [2021-03-26 10:28:55,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 71 [2021-03-26 10:28:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:55,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174914741] [2021-03-26 10:28:55,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:55,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:28:55,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980725595] [2021-03-26 10:28:55,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:28:55,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:55,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:28:55,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:28:55,942 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 174 [2021-03-26 10:28:55,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 89 transitions, 1245 flow. Second operand has 8 states, 8 states have (on average 123.875) internal successors, (991), 8 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:55,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:55,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 174 [2021-03-26 10:28:55,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:56,387 INFO L129 PetriNetUnfolder]: 167/523 cut-off events. [2021-03-26 10:28:56,387 INFO L130 PetriNetUnfolder]: For 8874/8936 co-relation queries the response was YES. [2021-03-26 10:28:56,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3763 conditions, 523 events. 167/523 cut-off events. For 8874/8936 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3671 event pairs, 3 based on Foata normal form. 34/553 useless extension candidates. Maximal degree in co-relation 3717. Up to 221 conditions per place. [2021-03-26 10:28:56,392 INFO L132 encePairwiseOnDemand]: 166/174 looper letters, 47 selfloop transitions, 47 changer transitions 2/109 dead transitions. [2021-03-26 10:28:56,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 109 transitions, 1719 flow [2021-03-26 10:28:56,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:28:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:28:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2021-03-26 10:28:56,394 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7375478927203065 [2021-03-26 10:28:56,395 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 770 transitions. [2021-03-26 10:28:56,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 770 transitions. [2021-03-26 10:28:56,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:56,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 770 transitions. [2021-03-26 10:28:56,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:56,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:56,397 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:56,397 INFO L185 Difference]: Start difference. First operand has 97 places, 89 transitions, 1245 flow. Second operand 6 states and 770 transitions. [2021-03-26 10:28:56,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 109 transitions, 1719 flow [2021-03-26 10:28:56,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 109 transitions, 1656 flow, removed 9 selfloop flow, removed 5 redundant places. [2021-03-26 10:28:56,414 INFO L241 Difference]: Finished difference. Result has 100 places, 101 transitions, 1562 flow [2021-03-26 10:28:56,414 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1562, PETRI_PLACES=100, PETRI_TRANSITIONS=101} [2021-03-26 10:28:56,415 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 52 predicate places. [2021-03-26 10:28:56,415 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:56,415 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 101 transitions, 1562 flow [2021-03-26 10:28:56,415 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 101 transitions, 1562 flow [2021-03-26 10:28:56,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 1562 flow [2021-03-26 10:28:56,484 INFO L129 PetriNetUnfolder]: 163/521 cut-off events. [2021-03-26 10:28:56,484 INFO L130 PetriNetUnfolder]: For 7392/7434 co-relation queries the response was YES. [2021-03-26 10:28:56,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3630 conditions, 521 events. 163/521 cut-off events. For 7392/7434 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3750 event pairs, 8 based on Foata normal form. 23/540 useless extension candidates. Maximal degree in co-relation 3585. Up to 217 conditions per place. [2021-03-26 10:28:56,491 INFO L142 LiptonReduction]: Number of co-enabled transitions 458 [2021-03-26 10:28:56,513 INFO L154 LiptonReduction]: Checked pairs total: 658 [2021-03-26 10:28:56,513 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:56,513 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 98 [2021-03-26 10:28:56,514 INFO L480 AbstractCegarLoop]: Abstraction has has 100 places, 101 transitions, 1562 flow [2021-03-26 10:28:56,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 123.875) internal successors, (991), 8 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:56,514 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:56,514 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:56,514 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 10:28:56,514 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:56,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1281606434, now seen corresponding path program 1 times [2021-03-26 10:28:56,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:56,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229359007] [2021-03-26 10:28:56,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:56,580 INFO L142 QuantifierPusher]: treesize reduction 30, result has 34.8 percent of original size [2021-03-26 10:28:56,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:28:56,588 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.4 percent of original size [2021-03-26 10:28:56,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-03-26 10:28:56,648 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.5 percent of original size [2021-03-26 10:28:56,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 77 [2021-03-26 10:28:56,730 INFO L142 QuantifierPusher]: treesize reduction 32, result has 71.7 percent of original size [2021-03-26 10:28:56,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2021-03-26 10:28:56,813 INFO L142 QuantifierPusher]: treesize reduction 53, result has 75.1 percent of original size [2021-03-26 10:28:56,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 160 [2021-03-26 10:28:56,924 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 41 [2021-03-26 10:28:56,926 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.3 percent of original size [2021-03-26 10:28:56,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 72 [2021-03-26 10:28:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:28:56,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229359007] [2021-03-26 10:28:56,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:56,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:28:56,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923277600] [2021-03-26 10:28:56,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:28:56,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:56,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:28:56,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:28:56,998 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 174 [2021-03-26 10:28:56,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 101 transitions, 1562 flow. Second operand has 8 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:56,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:56,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 174 [2021-03-26 10:28:56,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:57,432 INFO L129 PetriNetUnfolder]: 161/590 cut-off events. [2021-03-26 10:28:57,432 INFO L130 PetriNetUnfolder]: For 10773/10852 co-relation queries the response was YES. [2021-03-26 10:28:57,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4353 conditions, 590 events. 161/590 cut-off events. For 10773/10852 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4659 event pairs, 1 based on Foata normal form. 73/659 useless extension candidates. Maximal degree in co-relation 4306. Up to 259 conditions per place. [2021-03-26 10:28:57,437 INFO L132 encePairwiseOnDemand]: 165/174 looper letters, 38 selfloop transitions, 48 changer transitions 28/127 dead transitions. [2021-03-26 10:28:57,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 127 transitions, 2200 flow [2021-03-26 10:28:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:28:57,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:28:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 953 transitions. [2021-03-26 10:28:57,440 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6846264367816092 [2021-03-26 10:28:57,440 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 953 transitions. [2021-03-26 10:28:57,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 953 transitions. [2021-03-26 10:28:57,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:57,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 953 transitions. [2021-03-26 10:28:57,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:57,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 174.0) internal successors, (1566), 9 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:57,443 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 174.0) internal successors, (1566), 9 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:28:57,443 INFO L185 Difference]: Start difference. First operand has 100 places, 101 transitions, 1562 flow. Second operand 8 states and 953 transitions. [2021-03-26 10:28:57,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 127 transitions, 2200 flow [2021-03-26 10:28:57,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 127 transitions, 2113 flow, removed 43 selfloop flow, removed 1 redundant places. [2021-03-26 10:28:57,464 INFO L241 Difference]: Finished difference. Result has 110 places, 94 transitions, 1575 flow [2021-03-26 10:28:57,464 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1575, PETRI_PLACES=110, PETRI_TRANSITIONS=94} [2021-03-26 10:28:57,464 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 62 predicate places. [2021-03-26 10:28:57,464 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:57,465 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 94 transitions, 1575 flow [2021-03-26 10:28:57,465 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 94 transitions, 1575 flow [2021-03-26 10:28:57,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 94 transitions, 1575 flow [2021-03-26 10:28:57,524 INFO L129 PetriNetUnfolder]: 118/474 cut-off events. [2021-03-26 10:28:57,524 INFO L130 PetriNetUnfolder]: For 6980/7007 co-relation queries the response was YES. [2021-03-26 10:28:57,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 474 events. 118/474 cut-off events. For 6980/7007 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3654 event pairs, 2 based on Foata normal form. 16/486 useless extension candidates. Maximal degree in co-relation 3326. Up to 221 conditions per place. [2021-03-26 10:28:57,529 INFO L142 LiptonReduction]: Number of co-enabled transitions 400 [2021-03-26 10:28:59,267 WARN L205 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2021-03-26 10:28:59,711 WARN L205 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-26 10:29:02,218 WARN L205 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-26 10:29:03,272 WARN L205 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 305 [2021-03-26 10:29:03,297 INFO L154 LiptonReduction]: Checked pairs total: 1573 [2021-03-26 10:29:03,297 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:29:03,297 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5833 [2021-03-26 10:29:03,299 INFO L480 AbstractCegarLoop]: Abstraction has has 108 places, 94 transitions, 1584 flow [2021-03-26 10:29:03,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:03,299 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:03,299 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:29:03,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-26 10:29:03,299 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:03,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:03,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1438160927, now seen corresponding path program 1 times [2021-03-26 10:29:03,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:03,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074699928] [2021-03-26 10:29:03,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:29:03,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:03,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:03,359 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:29:03,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:29:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:29:03,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074699928] [2021-03-26 10:29:03,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:29:03,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:29:03,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859564331] [2021-03-26 10:29:03,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:29:03,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:29:03,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:29:03,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:29:03,367 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 175 [2021-03-26 10:29:03,367 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 94 transitions, 1584 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:03,367 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:29:03,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 175 [2021-03-26 10:29:03,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:29:03,463 INFO L129 PetriNetUnfolder]: 219/606 cut-off events. [2021-03-26 10:29:03,464 INFO L130 PetriNetUnfolder]: For 16342/16585 co-relation queries the response was YES. [2021-03-26 10:29:03,466 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 606 events. 219/606 cut-off events. For 16342/16585 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 4535 event pairs, 60 based on Foata normal form. 68/645 useless extension candidates. Maximal degree in co-relation 2703. Up to 329 conditions per place. [2021-03-26 10:29:03,468 INFO L132 encePairwiseOnDemand]: 168/175 looper letters, 9 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2021-03-26 10:29:03,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 71 transitions, 1048 flow [2021-03-26 10:29:03,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:29:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:29:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 746 transitions. [2021-03-26 10:29:03,470 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8525714285714285 [2021-03-26 10:29:03,470 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 746 transitions. [2021-03-26 10:29:03,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 746 transitions. [2021-03-26 10:29:03,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:29:03,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 746 transitions. [2021-03-26 10:29:03,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:03,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:03,473 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:03,473 INFO L185 Difference]: Start difference. First operand has 108 places, 94 transitions, 1584 flow. Second operand 5 states and 746 transitions. [2021-03-26 10:29:03,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 71 transitions, 1048 flow [2021-03-26 10:29:03,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 71 transitions, 769 flow, removed 65 selfloop flow, removed 28 redundant places. [2021-03-26 10:29:03,486 INFO L241 Difference]: Finished difference. Result has 86 places, 68 transitions, 779 flow [2021-03-26 10:29:03,486 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=779, PETRI_PLACES=86, PETRI_TRANSITIONS=68} [2021-03-26 10:29:03,486 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 38 predicate places. [2021-03-26 10:29:03,486 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:29:03,486 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 68 transitions, 779 flow [2021-03-26 10:29:03,486 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 68 transitions, 779 flow [2021-03-26 10:29:03,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 68 transitions, 779 flow [2021-03-26 10:29:03,530 INFO L129 PetriNetUnfolder]: 216/601 cut-off events. [2021-03-26 10:29:03,530 INFO L130 PetriNetUnfolder]: For 5794/5957 co-relation queries the response was YES. [2021-03-26 10:29:03,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2604 conditions, 601 events. 216/601 cut-off events. For 5794/5957 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 4596 event pairs, 60 based on Foata normal form. 35/592 useless extension candidates. Maximal degree in co-relation 2568. Up to 380 conditions per place. [2021-03-26 10:29:03,535 INFO L142 LiptonReduction]: Number of co-enabled transitions 492 [2021-03-26 10:29:03,536 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:29:03,536 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:29:03,537 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 50 [2021-03-26 10:29:03,537 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 779 flow [2021-03-26 10:29:03,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:03,538 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:03,538 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:29:03,538 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-26 10:29:03,538 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:03,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:03,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1633312886, now seen corresponding path program 1 times [2021-03-26 10:29:03,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:03,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963866349] [2021-03-26 10:29:03,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:29:03,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:03,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:03,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:03,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:03,585 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:29:03,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:29:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:29:03,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963866349] [2021-03-26 10:29:03,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:29:03,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:29:03,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68208530] [2021-03-26 10:29:03,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:29:03,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:29:03,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:29:03,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:29:03,596 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 175 [2021-03-26 10:29:03,596 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 68 transitions, 779 flow. Second operand has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:03,596 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:29:03,596 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 175 [2021-03-26 10:29:03,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:29:03,686 INFO L129 PetriNetUnfolder]: 166/531 cut-off events. [2021-03-26 10:29:03,686 INFO L130 PetriNetUnfolder]: For 7719/8448 co-relation queries the response was YES. [2021-03-26 10:29:03,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 531 events. 166/531 cut-off events. For 7719/8448 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 4154 event pairs, 5 based on Foata normal form. 304/813 useless extension candidates. Maximal degree in co-relation 2453. Up to 354 conditions per place. [2021-03-26 10:29:03,690 INFO L132 encePairwiseOnDemand]: 168/175 looper letters, 5 selfloop transitions, 15 changer transitions 3/75 dead transitions. [2021-03-26 10:29:03,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 75 transitions, 834 flow [2021-03-26 10:29:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:29:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:29:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1041 transitions. [2021-03-26 10:29:03,692 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8497959183673469 [2021-03-26 10:29:03,692 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1041 transitions. [2021-03-26 10:29:03,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1041 transitions. [2021-03-26 10:29:03,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:29:03,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1041 transitions. [2021-03-26 10:29:03,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 148.71428571428572) internal successors, (1041), 7 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:03,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:03,694 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:03,694 INFO L185 Difference]: Start difference. First operand has 86 places, 68 transitions, 779 flow. Second operand 7 states and 1041 transitions. [2021-03-26 10:29:03,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 75 transitions, 834 flow [2021-03-26 10:29:03,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 75 transitions, 803 flow, removed 12 selfloop flow, removed 3 redundant places. [2021-03-26 10:29:03,701 INFO L241 Difference]: Finished difference. Result has 90 places, 72 transitions, 798 flow [2021-03-26 10:29:03,701 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=798, PETRI_PLACES=90, PETRI_TRANSITIONS=72} [2021-03-26 10:29:03,702 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 42 predicate places. [2021-03-26 10:29:03,702 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:29:03,702 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 72 transitions, 798 flow [2021-03-26 10:29:03,702 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 72 transitions, 798 flow [2021-03-26 10:29:03,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 72 transitions, 798 flow [2021-03-26 10:29:03,739 INFO L129 PetriNetUnfolder]: 150/507 cut-off events. [2021-03-26 10:29:03,739 INFO L130 PetriNetUnfolder]: For 3678/4020 co-relation queries the response was YES. [2021-03-26 10:29:03,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2531 conditions, 507 events. 150/507 cut-off events. For 3678/4020 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 4105 event pairs, 5 based on Foata normal form. 12/494 useless extension candidates. Maximal degree in co-relation 2492. Up to 330 conditions per place. [2021-03-26 10:29:03,744 INFO L142 LiptonReduction]: Number of co-enabled transitions 564 [2021-03-26 10:29:03,750 INFO L154 LiptonReduction]: Checked pairs total: 75 [2021-03-26 10:29:03,750 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:29:03,750 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 48 [2021-03-26 10:29:03,750 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 70 transitions, 782 flow [2021-03-26 10:29:03,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:03,750 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:03,751 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:29:03,751 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-26 10:29:03,751 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:03,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:03,751 INFO L82 PathProgramCache]: Analyzing trace with hash 112431090, now seen corresponding path program 1 times [2021-03-26 10:29:03,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:03,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710757093] [2021-03-26 10:29:03,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:29:03,880 INFO L142 QuantifierPusher]: treesize reduction 60, result has 24.1 percent of original size [2021-03-26 10:29:03,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:29:03,892 INFO L142 QuantifierPusher]: treesize reduction 42, result has 72.0 percent of original size [2021-03-26 10:29:03,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 108 [2021-03-26 10:29:03,966 INFO L142 QuantifierPusher]: treesize reduction 32, result has 69.8 percent of original size [2021-03-26 10:29:03,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-03-26 10:29:03,977 INFO L142 QuantifierPusher]: treesize reduction 56, result has 73.8 percent of original size [2021-03-26 10:29:03,979 INFO L147 QuantifierPusher]: treesize reduction 27, result has 82.9 percent of original size 131 [2021-03-26 10:29:04,069 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.1 percent of original size [2021-03-26 10:29:04,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-26 10:29:04,119 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.9 percent of original size [2021-03-26 10:29:04,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-26 10:29:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:29:04,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710757093] [2021-03-26 10:29:04,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:29:04,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:29:04,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005054001] [2021-03-26 10:29:04,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:29:04,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:29:04,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:29:04,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:29:04,168 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 175 [2021-03-26 10:29:04,168 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 70 transitions, 782 flow. Second operand has 7 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:04,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:29:04,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 175 [2021-03-26 10:29:04,168 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:29:04,432 INFO L129 PetriNetUnfolder]: 103/332 cut-off events. [2021-03-26 10:29:04,432 INFO L130 PetriNetUnfolder]: For 3871/3934 co-relation queries the response was YES. [2021-03-26 10:29:04,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 332 events. 103/332 cut-off events. For 3871/3934 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2071 event pairs, 11 based on Foata normal form. 22/347 useless extension candidates. Maximal degree in co-relation 1758. Up to 201 conditions per place. [2021-03-26 10:29:04,434 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 11 selfloop transitions, 13 changer transitions 26/67 dead transitions. [2021-03-26 10:29:04,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 67 transitions, 854 flow [2021-03-26 10:29:04,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:29:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:29:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 721 transitions. [2021-03-26 10:29:04,443 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6866666666666666 [2021-03-26 10:29:04,443 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 721 transitions. [2021-03-26 10:29:04,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 721 transitions. [2021-03-26 10:29:04,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:29:04,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 721 transitions. [2021-03-26 10:29:04,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:04,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:04,458 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:04,458 INFO L185 Difference]: Start difference. First operand has 90 places, 70 transitions, 782 flow. Second operand 6 states and 721 transitions. [2021-03-26 10:29:04,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 67 transitions, 854 flow [2021-03-26 10:29:04,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 67 transitions, 825 flow, removed 11 selfloop flow, removed 5 redundant places. [2021-03-26 10:29:04,466 INFO L241 Difference]: Finished difference. Result has 86 places, 40 transitions, 455 flow [2021-03-26 10:29:04,466 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=86, PETRI_TRANSITIONS=40} [2021-03-26 10:29:04,466 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 38 predicate places. [2021-03-26 10:29:04,467 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:29:04,467 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 40 transitions, 455 flow [2021-03-26 10:29:04,467 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 40 transitions, 455 flow [2021-03-26 10:29:04,467 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 40 transitions, 455 flow [2021-03-26 10:29:04,476 INFO L129 PetriNetUnfolder]: 26/85 cut-off events. [2021-03-26 10:29:04,476 INFO L130 PetriNetUnfolder]: For 1044/1048 co-relation queries the response was YES. [2021-03-26 10:29:04,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 85 events. 26/85 cut-off events. For 1044/1048 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 268 event pairs, 3 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 459. Up to 30 conditions per place. [2021-03-26 10:29:04,477 INFO L142 LiptonReduction]: Number of co-enabled transitions 102 [2021-03-26 10:29:04,836 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-26 10:29:05,262 WARN L205 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2021-03-26 10:29:05,410 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 10:29:05,412 INFO L154 LiptonReduction]: Checked pairs total: 8 [2021-03-26 10:29:05,412 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:29:05,412 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 946 [2021-03-26 10:29:05,413 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 38 transitions, 467 flow [2021-03-26 10:29:05,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:05,413 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:05,413 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:29:05,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-26 10:29:05,413 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:05,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:05,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2017036782, now seen corresponding path program 1 times [2021-03-26 10:29:05,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:05,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185505329] [2021-03-26 10:29:05,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:29:05,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:05,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:05,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:05,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:05,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:05,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:05,473 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:29:05,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:29:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:29:05,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185505329] [2021-03-26 10:29:05,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:29:05,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:29:05,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718878597] [2021-03-26 10:29:05,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:29:05,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:29:05,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:29:05,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:29:05,483 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 178 [2021-03-26 10:29:05,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 38 transitions, 467 flow. Second operand has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:05,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:29:05,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 178 [2021-03-26 10:29:05,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:29:05,534 INFO L129 PetriNetUnfolder]: 20/73 cut-off events. [2021-03-26 10:29:05,535 INFO L130 PetriNetUnfolder]: For 1284/1311 co-relation queries the response was YES. [2021-03-26 10:29:05,535 INFO L84 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 73 events. 20/73 cut-off events. For 1284/1311 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 223 event pairs, 0 based on Foata normal form. 16/88 useless extension candidates. Maximal degree in co-relation 396. Up to 26 conditions per place. [2021-03-26 10:29:05,535 INFO L132 encePairwiseOnDemand]: 172/178 looper letters, 2 selfloop transitions, 11 changer transitions 3/42 dead transitions. [2021-03-26 10:29:05,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 42 transitions, 529 flow [2021-03-26 10:29:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:29:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:29:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1054 transitions. [2021-03-26 10:29:05,538 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8459069020866774 [2021-03-26 10:29:05,538 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1054 transitions. [2021-03-26 10:29:05,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1054 transitions. [2021-03-26 10:29:05,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:29:05,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1054 transitions. [2021-03-26 10:29:05,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 150.57142857142858) internal successors, (1054), 7 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:05,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:05,540 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:05,540 INFO L185 Difference]: Start difference. First operand has 74 places, 38 transitions, 467 flow. Second operand 7 states and 1054 transitions. [2021-03-26 10:29:05,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 42 transitions, 529 flow [2021-03-26 10:29:05,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 42 transitions, 358 flow, removed 40 selfloop flow, removed 24 redundant places. [2021-03-26 10:29:05,543 INFO L241 Difference]: Finished difference. Result has 59 places, 39 transitions, 344 flow [2021-03-26 10:29:05,543 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=344, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2021-03-26 10:29:05,543 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2021-03-26 10:29:05,543 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:29:05,544 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 39 transitions, 344 flow [2021-03-26 10:29:05,544 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 39 transitions, 344 flow [2021-03-26 10:29:05,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 39 transitions, 344 flow [2021-03-26 10:29:05,550 INFO L129 PetriNetUnfolder]: 18/70 cut-off events. [2021-03-26 10:29:05,551 INFO L130 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2021-03-26 10:29:05,551 INFO L84 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 70 events. 18/70 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 230 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 302. Up to 23 conditions per place. [2021-03-26 10:29:05,551 INFO L142 LiptonReduction]: Number of co-enabled transitions 90 [2021-03-26 10:29:05,837 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:29:06,169 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:29:06,719 WARN L205 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:29:07,363 WARN L205 SmtUtils]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:29:07,366 INFO L154 LiptonReduction]: Checked pairs total: 5 [2021-03-26 10:29:07,367 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:29:07,367 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1824 [2021-03-26 10:29:07,367 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 332 flow [2021-03-26 10:29:07,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:07,367 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:07,367 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:29:07,367 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-26 10:29:07,367 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:07,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:07,368 INFO L82 PathProgramCache]: Analyzing trace with hash -707509775, now seen corresponding path program 1 times [2021-03-26 10:29:07,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:07,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615300159] [2021-03-26 10:29:07,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:29:07,397 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:29:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:29:07,424 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:29:07,450 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:29:07,450 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:29:07,450 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-26 10:29:07,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:29:07 BasicIcfg [2021-03-26 10:29:07,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:29:07,542 INFO L168 Benchmark]: Toolchain (without parser) took 41016.80 ms. Allocated memory was 331.4 MB in the beginning and 1.0 GB in the end (delta: 717.2 MB). Free memory was 294.7 MB in the beginning and 936.5 MB in the end (delta: -641.9 MB). Peak memory consumption was 78.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:29:07,542 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 331.4 MB. Free memory was 312.9 MB in the beginning and 312.8 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:29:07,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 517.20 ms. Allocated memory is still 331.4 MB. Free memory was 294.4 MB in the beginning and 288.0 MB in the end (delta: 6.4 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:29:07,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.04 ms. Allocated memory is still 331.4 MB. Free memory was 288.0 MB in the beginning and 284.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:29:07,546 INFO L168 Benchmark]: Boogie Preprocessor took 45.31 ms. Allocated memory is still 331.4 MB. Free memory was 284.9 MB in the beginning and 281.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:29:07,546 INFO L168 Benchmark]: RCFGBuilder took 2298.31 ms. Allocated memory was 331.4 MB in the beginning and 427.8 MB in the end (delta: 96.5 MB). Free memory was 281.7 MB in the beginning and 300.2 MB in the end (delta: -18.5 MB). Peak memory consumption was 166.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:29:07,546 INFO L168 Benchmark]: TraceAbstraction took 38114.20 ms. Allocated memory was 427.8 MB in the beginning and 1.0 GB in the end (delta: 620.8 MB). Free memory was 300.2 MB in the beginning and 936.5 MB in the end (delta: -636.3 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:29:07,547 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.50 ms. Allocated memory is still 331.4 MB. Free memory was 312.9 MB in the beginning and 312.8 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 517.20 ms. Allocated memory is still 331.4 MB. Free memory was 294.4 MB in the beginning and 288.0 MB in the end (delta: 6.4 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 38.04 ms. Allocated memory is still 331.4 MB. Free memory was 288.0 MB in the beginning and 284.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 45.31 ms. Allocated memory is still 331.4 MB. Free memory was 284.9 MB in the beginning and 281.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2298.31 ms. Allocated memory was 331.4 MB in the beginning and 427.8 MB in the end (delta: 96.5 MB). Free memory was 281.7 MB in the beginning and 300.2 MB in the end (delta: -18.5 MB). Peak memory consumption was 166.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 38114.20 ms. Allocated memory was 427.8 MB in the beginning and 1.0 GB in the end (delta: 620.8 MB). Free memory was 300.2 MB in the beginning and 936.5 MB in the end (delta: -636.3 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8641.1ms, 102 PlacesBefore, 48 PlacesAfterwards, 94 TransitionsBefore, 39 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 61 TotalNumberOfCompositions, 3074 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1325, positive: 1245, positive conditional: 1245, positive unconditional: 0, negative: 80, negative conditional: 80, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1325, positive: 1245, positive conditional: 0, positive unconditional: 1245, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1325, positive: 1245, positive conditional: 0, positive unconditional: 1245, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1040, positive: 1005, positive conditional: 0, positive unconditional: 1005, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1040, positive: 996, positive conditional: 0, positive unconditional: 996, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 756, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 736, negative conditional: 0, negative unconditional: 736, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1325, positive: 240, positive conditional: 0, positive unconditional: 240, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 1040, unknown conditional: 0, unknown unconditional: 1040] , Statistics on independence cache: Total cache size (in pairs): 1040, Positive cache size: 1005, Positive conditional cache size: 0, Positive unconditional cache size: 1005, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4510.9ms, 45 PlacesBefore, 34 PlacesAfterwards, 36 TransitionsBefore, 25 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1020 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 235, positive: 173, positive conditional: 173, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 235, positive: 173, positive conditional: 6, positive unconditional: 167, negative: 62, negative conditional: 3, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 235, positive: 173, positive conditional: 6, positive unconditional: 167, negative: 62, negative conditional: 3, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 99, positive: 87, positive conditional: 4, positive unconditional: 83, negative: 12, negative conditional: 1, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 99, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 12, negative conditional: 1, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 148, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 142, negative conditional: 12, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 235, positive: 86, positive conditional: 2, positive unconditional: 84, negative: 50, negative conditional: 2, negative unconditional: 48, unknown: 99, unknown conditional: 5, unknown unconditional: 94] , Statistics on independence cache: Total cache size (in pairs): 1139, Positive cache size: 1092, Positive conditional cache size: 4, Positive unconditional cache size: 1088, Negative cache size: 47, Negative conditional cache size: 1, Negative unconditional cache size: 46, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 971.4ms, 42 PlacesBefore, 35 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 330 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125, positive: 104, positive conditional: 104, 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: 125, positive: 104, positive conditional: 15, positive unconditional: 89, 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: 125, positive: 104, positive conditional: 15, positive unconditional: 89, 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: 13, positive: 11, positive conditional: 2, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 125, positive: 93, positive conditional: 13, positive unconditional: 80, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 13, unknown conditional: 2, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 1152, Positive cache size: 1103, Positive conditional cache size: 6, Positive unconditional cache size: 1097, Negative cache size: 49, Negative conditional cache size: 1, Negative unconditional cache size: 48, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 78.4ms, 36 PlacesBefore, 36 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 74 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, positive: 16, positive conditional: 2, positive unconditional: 14, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 16, positive conditional: 2, positive unconditional: 14, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 21, positive: 16, positive conditional: 2, positive unconditional: 14, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1152, Positive cache size: 1103, Positive conditional cache size: 6, Positive unconditional cache size: 1097, Negative cache size: 49, Negative conditional cache size: 1, Negative unconditional cache size: 48, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.1ms, 38 PlacesBefore, 38 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 65 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 35, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1154, Positive cache size: 1104, Positive conditional cache size: 6, Positive unconditional cache size: 1098, Negative cache size: 50, Negative conditional cache size: 1, Negative unconditional cache size: 49, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.3ms, 39 PlacesBefore, 39 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 78 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 6, negative conditional: 0, negative unconditional: 6, 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: 11, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1154, Positive cache size: 1104, Positive conditional cache size: 6, Positive unconditional cache size: 1098, Negative cache size: 50, Negative conditional cache size: 1, Negative unconditional cache size: 49, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.6ms, 41 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 71 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, positive: 9, positive conditional: 1, positive unconditional: 8, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 1, positive unconditional: 8, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , 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: 14, positive: 6, positive conditional: 1, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1157, Positive cache size: 1107, Positive conditional cache size: 6, Positive unconditional cache size: 1101, Negative cache size: 50, Negative conditional cache size: 1, Negative unconditional cache size: 49, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.4ms, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 73 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 16, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1159, Positive cache size: 1109, Positive conditional cache size: 6, Positive unconditional cache size: 1103, Negative cache size: 50, Negative conditional cache size: 1, Negative unconditional cache size: 49, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.8ms, 47 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 74 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, positive: 13, positive conditional: 2, positive unconditional: 11, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, positive: 13, positive conditional: 2, positive unconditional: 11, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, positive: 11, positive conditional: 2, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1162, Positive cache size: 1111, Positive conditional cache size: 6, Positive unconditional cache size: 1105, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.5ms, 51 PlacesBefore, 51 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 143 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, positive: 12, positive conditional: 2, positive unconditional: 10, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 12, positive conditional: 2, positive unconditional: 10, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 31, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, positive: 11, positive conditional: 2, positive unconditional: 9, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1164, Positive cache size: 1112, Positive conditional cache size: 6, Positive unconditional cache size: 1106, Negative cache size: 52, Negative conditional cache size: 1, Negative unconditional cache size: 51, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2486.1ms, 52 PlacesBefore, 52 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 209 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, positive: 48, positive conditional: 14, positive unconditional: 34, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 48, positive conditional: 14, positive unconditional: 34, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 3, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, positive: 42, positive conditional: 11, positive unconditional: 31, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1170, Positive cache size: 1118, Positive conditional cache size: 9, Positive unconditional cache size: 1109, Negative cache size: 52, Negative conditional cache size: 1, Negative unconditional cache size: 51, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.1ms, 58 PlacesBefore, 58 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 157 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, positive: 56, positive conditional: 56, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, positive: 56, positive conditional: 19, positive unconditional: 37, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, positive: 56, positive conditional: 19, positive unconditional: 37, negative: 7, negative conditional: 0, negative unconditional: 7, 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: 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: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 63, positive: 48, positive conditional: 16, positive unconditional: 32, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1178, Positive cache size: 1126, Positive conditional cache size: 12, Positive unconditional cache size: 1114, Negative cache size: 52, Negative conditional cache size: 1, Negative unconditional cache size: 51, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2678.0ms, 64 PlacesBefore, 64 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 401 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, positive: 142, positive conditional: 142, 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: 162, positive: 142, positive conditional: 52, positive unconditional: 90, negative: 20, negative conditional: 2, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 162, positive: 142, positive conditional: 52, positive unconditional: 90, negative: 20, negative conditional: 2, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 3, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 162, positive: 137, positive conditional: 49, positive unconditional: 88, negative: 19, negative conditional: 1, negative unconditional: 18, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1184, Positive cache size: 1131, Positive conditional cache size: 15, Positive unconditional cache size: 1116, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 105.6ms, 73 PlacesBefore, 73 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 252 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, positive: 56, positive conditional: 56, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, positive: 56, positive conditional: 22, positive unconditional: 34, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 56, positive conditional: 22, positive unconditional: 34, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, positive: 54, positive conditional: 21, positive unconditional: 33, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1186, Positive cache size: 1133, Positive conditional cache size: 16, Positive unconditional cache size: 1117, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.3ms, 78 PlacesBefore, 78 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 304 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 86, positive: 73, positive conditional: 45, positive unconditional: 28, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 73, positive conditional: 45, positive unconditional: 28, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, positive: 72, positive conditional: 44, positive unconditional: 28, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1187, Positive cache size: 1134, Positive conditional cache size: 17, Positive unconditional cache size: 1117, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 126.2ms, 95 PlacesBefore, 94 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 523 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 161, positive: 145, positive conditional: 145, 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: 161, positive: 145, positive conditional: 70, positive unconditional: 75, 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: 161, positive: 145, positive conditional: 70, positive unconditional: 75, 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: 8, positive: 8, positive conditional: 1, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 161, positive: 137, positive conditional: 69, positive unconditional: 68, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 8, unknown conditional: 1, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 1195, Positive cache size: 1142, Positive conditional cache size: 18, Positive unconditional cache size: 1124, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 74.3ms, 98 PlacesBefore, 97 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 547 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 225, positive: 207, positive conditional: 207, 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: 225, positive: 207, positive conditional: 102, positive unconditional: 105, 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: 225, positive: 207, positive conditional: 102, positive unconditional: 105, 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: 225, positive: 204, positive conditional: 100, positive unconditional: 104, 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): 1198, Positive cache size: 1145, Positive conditional cache size: 20, Positive unconditional cache size: 1125, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 97.9ms, 100 PlacesBefore, 100 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 658 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 237, positive: 218, positive conditional: 218, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 237, positive: 218, positive conditional: 107, positive unconditional: 111, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 237, positive: 218, positive conditional: 107, positive unconditional: 111, negative: 19, negative conditional: 0, negative unconditional: 19, 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: 237, positive: 217, positive conditional: 107, positive unconditional: 110, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1199, Positive cache size: 1146, Positive conditional cache size: 20, Positive unconditional cache size: 1126, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 60 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5832.5ms, 110 PlacesBefore, 108 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1573 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 658, positive: 607, positive conditional: 607, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 658, positive: 607, positive conditional: 395, positive unconditional: 212, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 658, positive: 607, positive conditional: 395, positive unconditional: 212, negative: 51, negative conditional: 0, negative unconditional: 51, 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: 658, positive: 607, positive conditional: 395, positive unconditional: 212, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1199, Positive cache size: 1146, Positive conditional cache size: 20, Positive unconditional cache size: 1126, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 78 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.1ms, 86 PlacesBefore, 86 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 492 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): 1199, Positive cache size: 1146, Positive conditional cache size: 20, Positive unconditional cache size: 1126, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 47.9ms, 90 PlacesBefore, 90 PlacesAfterwards, 72 TransitionsBefore, 70 TransitionsAfterwards, 564 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 75 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, positive: 75, positive conditional: 75, 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: 75, positive: 75, positive conditional: 66, positive unconditional: 9, 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: 75, positive: 75, positive conditional: 66, positive unconditional: 9, 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: 75, positive: 75, positive conditional: 66, positive unconditional: 9, 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): 1199, Positive cache size: 1146, Positive conditional cache size: 20, Positive unconditional cache size: 1126, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 945.4ms, 86 PlacesBefore, 74 PlacesAfterwards, 40 TransitionsBefore, 38 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 8 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, positive: 8, positive conditional: 4, positive unconditional: 4, 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: 8, positive: 8, positive conditional: 4, positive unconditional: 4, 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: 7, positive: 7, positive conditional: 4, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1206, Positive cache size: 1153, Positive conditional cache size: 24, Positive unconditional cache size: 1129, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1822.8ms, 59 PlacesBefore, 56 PlacesAfterwards, 39 TransitionsBefore, 37 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 5 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, 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: 5, positive: 5, positive conditional: 4, positive unconditional: 1, 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: 5, positive: 5, positive conditional: 4, positive unconditional: 1, 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: 5, positive: 5, positive conditional: 4, positive unconditional: 1, 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): 1206, Positive cache size: 1153, Positive conditional cache size: 24, Positive unconditional cache size: 1129, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L846] 0 pthread_t t1874; [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L770] 2 x = 2 [L773] 2 y = 1 [L776] 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) [L776] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L776] 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) [L776] 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) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L778] 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 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L780] 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 [L848] 0 pthread_t t1875; [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L811] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L812] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L813] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L814] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L815] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L816] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L822] 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) [L822] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L822] 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) [L822] 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) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 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 [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 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 [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L855] 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) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] 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) [L855] 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) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 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 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 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 [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] 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) [L866] 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) [L867] 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)) [L867] EXPR 0 !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) [L867] 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)) [L867] 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)) [L868] 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)) [L868] EXPR 0 !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) [L868] 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)) [L868] 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)) [L869] 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)) [L869] EXPR 0 !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) [L869] 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)) [L869] 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)) [L870] 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)) [L870] EXPR 0 !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) [L870] 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)) [L870] 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)) [L871] 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)) [L871] EXPR 0 !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) [L871] 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)) [L871] 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)) [L872] 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)) [L872] EXPR 0 !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) [L872] 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)) [L872] 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)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=59, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 37925.9ms, OverallIterations: 23, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4563.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8693.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 102 SDtfs, 81 SDslu, 55 SDs, 0 SdLazy, 1015 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1358.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3239.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1584occurred in iteration=18, InterpolantAutomatonStates: 125, 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: 55.8ms SsaConstructionTime, 644.7ms SatisfiabilityAnalysisTime, 3446.8ms InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 4754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...