/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:35:16,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:35:16,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:35:16,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:35:16,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:35:16,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:35:16,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:35:16,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:35:16,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:35:16,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:35:16,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:35:16,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:35:16,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:35:16,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:35:16,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:35:16,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:35:16,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:35:16,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:35:16,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:35:16,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:35:16,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:35:16,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:35:16,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:35:16,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:35:16,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:35:16,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:35:16,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:35:16,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:35:16,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:35:16,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:35:16,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:35:16,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:35:16,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:35:16,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:35:16,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:35:16,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:35:16,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:35:16,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:35:16,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:35:16,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:35:16,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:35:16,299 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:35:16,317 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:35:16,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:35:16,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:35:16,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:35:16,319 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:35:16,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:35:16,320 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:35:16,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:35:16,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:35:16,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:35:16,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:35:16,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:35:16,320 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:35:16,320 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:35:16,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:35:16,321 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:35:16,321 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:35:16,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:35:16,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:35:16,321 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:35:16,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:35:16,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:35:16,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:35:16,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:35:16,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:35:16,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:35:16,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:35:16,322 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:35:16,323 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:35:16,323 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:35:16,323 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:35:16,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:35:16,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:35:16,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:35:16,661 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:35:16,662 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:35:16,663 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_pso.oepc.i [2021-03-26 00:35:16,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8764ca9e0/034f0387e5d14baeb9364d0284c4a45a/FLAG9fc145ccd [2021-03-26 00:35:17,332 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:35:17,332 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_pso.oepc.i [2021-03-26 00:35:17,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8764ca9e0/034f0387e5d14baeb9364d0284c4a45a/FLAG9fc145ccd [2021-03-26 00:35:17,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8764ca9e0/034f0387e5d14baeb9364d0284c4a45a [2021-03-26 00:35:17,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:35:17,629 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:35:17,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:35:17,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:35:17,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:35:17,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:35:17" (1/1) ... [2021-03-26 00:35:17,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ade3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:17, skipping insertion in model container [2021-03-26 00:35:17,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:35:17" (1/1) ... [2021-03-26 00:35:17,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:35:17,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:35:17,832 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_pso.oepc.i[950,963] [2021-03-26 00:35:18,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:35:18,129 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:35:18,140 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_pso.oepc.i[950,963] [2021-03-26 00:35:18,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:35:18,290 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:35:18,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:18 WrapperNode [2021-03-26 00:35:18,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:35:18,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:35:18,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:35:18,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:35:18,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:18" (1/1) ... [2021-03-26 00:35:18,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:18" (1/1) ... [2021-03-26 00:35:18,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:35:18,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:35:18,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:35:18,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:35:18,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:18" (1/1) ... [2021-03-26 00:35:18,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:18" (1/1) ... [2021-03-26 00:35:18,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:18" (1/1) ... [2021-03-26 00:35:18,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:18" (1/1) ... [2021-03-26 00:35:18,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:18" (1/1) ... [2021-03-26 00:35:18,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:18" (1/1) ... [2021-03-26 00:35:18,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:18" (1/1) ... [2021-03-26 00:35:18,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:35:18,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:35:18,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:35:18,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:35:18,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:35:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:35:18,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:35:18,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:35:18,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:35:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:35:18,539 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:35:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:35:18,540 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:35:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:35:18,540 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:35:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:35:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:35:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:35:18,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:35:18,542 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:35:21,530 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:35:21,530 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:35:21,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:35:21 BoogieIcfgContainer [2021-03-26 00:35:21,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:35:21,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:35:21,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:35:21,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:35:21,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:35:17" (1/3) ... [2021-03-26 00:35:21,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e8dbbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:35:21, skipping insertion in model container [2021-03-26 00:35:21,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:18" (2/3) ... [2021-03-26 00:35:21,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e8dbbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:35:21, skipping insertion in model container [2021-03-26 00:35:21,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:35:21" (3/3) ... [2021-03-26 00:35:21,539 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_pso.oepc.i [2021-03-26 00:35:21,545 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:35:21,550 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:35:21,550 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:35:21,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,595 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,595 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,596 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,596 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,596 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,596 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,601 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,601 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,602 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,602 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,605 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,606 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,606 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,606 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,638 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,638 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,638 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,640 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,641 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,648 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,650 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:21,657 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:35:21,693 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:35:21,721 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:35:21,721 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:35:21,721 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:35:21,721 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:35:21,721 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:35:21,721 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:35:21,721 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:35:21,722 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:35:21,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:35:21,766 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:35:21,767 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:35:21,770 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 00:35:21,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:35:21,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 00:35:21,777 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:21,788 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:35:21,791 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:35:21,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 00:35:21,823 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:35:21,826 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:35:21,827 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 00:35:21,833 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-26 00:35:24,040 WARN L205 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 174 [2021-03-26 00:35:24,324 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2021-03-26 00:35:25,753 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 299 DAG size of output: 254 [2021-03-26 00:35:26,369 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2021-03-26 00:35:26,615 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:35:26,982 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:35:27,095 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:35:28,287 WARN L205 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 00:35:28,928 WARN L205 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-26 00:35:30,227 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 00:35:30,775 WARN L205 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:35:31,640 INFO L154 LiptonReduction]: Checked pairs total: 3074 [2021-03-26 00:35:31,641 INFO L156 LiptonReduction]: Total number of compositions: 61 [2021-03-26 00:35:31,643 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9868 [2021-03-26 00:35:31,651 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-03-26 00:35:31,651 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:35:31,652 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:31,652 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:31,652 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 00:35:31,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:31,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1884620492, now seen corresponding path program 1 times [2021-03-26 00:35:31,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:31,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548615680] [2021-03-26 00:35:31,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:31,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:31,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:35:31,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:31,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:31,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548615680] [2021-03-26 00:35:31,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:31,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:35:31,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23132627] [2021-03-26 00:35:31,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:35:31,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:31,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:35:31,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:35:31,929 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 158 [2021-03-26 00:35:31,934 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 00:35:31,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:31,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 158 [2021-03-26 00:35:31,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:32,117 INFO L129 PetriNetUnfolder]: 115/347 cut-off events. [2021-03-26 00:35:32,117 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:35:32,118 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 00:35:32,121 INFO L132 encePairwiseOnDemand]: 154/158 looper letters, 13 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2021-03-26 00:35:32,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 123 flow [2021-03-26 00:35:32,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:35:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:35:32,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2021-03-26 00:35:32,134 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8860759493670886 [2021-03-26 00:35:32,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2021-03-26 00:35:32,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2021-03-26 00:35:32,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:32,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2021-03-26 00:35:32,143 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 00:35:32,158 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 00:35:32,158 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 00:35:32,160 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 420 transitions. [2021-03-26 00:35:32,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 123 flow [2021-03-26 00:35:32,162 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 00:35:32,164 INFO L241 Difference]: Finished difference. Result has 45 places, 36 transitions, 82 flow [2021-03-26 00:35:32,165 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 00:35:32,166 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-26 00:35:32,166 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:32,166 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 82 flow [2021-03-26 00:35:32,166 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 82 flow [2021-03-26 00:35:32,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 82 flow [2021-03-26 00:35:32,175 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-03-26 00:35:32,175 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:35:32,176 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 00:35:32,177 INFO L142 LiptonReduction]: Number of co-enabled transitions 360 [2021-03-26 00:35:32,461 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:35:32,892 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:35:33,187 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:35:33,778 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:35:34,390 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:35:34,989 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-03-26 00:35:35,259 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-03-26 00:35:35,853 WARN L205 SmtUtils]: Spent 592.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-03-26 00:35:36,534 WARN L205 SmtUtils]: Spent 679.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-03-26 00:35:36,968 INFO L154 LiptonReduction]: Checked pairs total: 1020 [2021-03-26 00:35:36,969 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 00:35:36,969 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4803 [2021-03-26 00:35:36,970 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2021-03-26 00:35:36,970 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 00:35:36,970 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:36,971 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:36,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:35:36,971 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 00:35:36,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:36,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1189168933, now seen corresponding path program 1 times [2021-03-26 00:35:36,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:36,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316558029] [2021-03-26 00:35:36,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:37,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:37,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:35:37,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:37,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:37,084 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:35:37,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:35:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:37,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316558029] [2021-03-26 00:35:37,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:37,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:35:37,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204960229] [2021-03-26 00:35:37,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:35:37,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:37,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:35:37,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:35:37,090 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 170 [2021-03-26 00:35:37,091 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:37,091 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:37,091 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 170 [2021-03-26 00:35:37,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:37,129 INFO L129 PetriNetUnfolder]: 1/28 cut-off events. [2021-03-26 00:35:37,130 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:35:37,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 1/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 34. Up to 3 conditions per place. [2021-03-26 00:35:37,130 INFO L132 encePairwiseOnDemand]: 166/170 looper letters, 1 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2021-03-26 00:35:37,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 76 flow [2021-03-26 00:35:37,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:35:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:35:37,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 747 transitions. [2021-03-26 00:35:37,138 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8788235294117647 [2021-03-26 00:35:37,138 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 747 transitions. [2021-03-26 00:35:37,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 747 transitions. [2021-03-26 00:35:37,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:37,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 747 transitions. [2021-03-26 00:35:37,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.4) internal successors, (747), 5 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 00:35:37,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:37,144 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:37,144 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 5 states and 747 transitions. [2021-03-26 00:35:37,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 76 flow [2021-03-26 00:35:37,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:35:37,145 INFO L241 Difference]: Finished difference. Result has 37 places, 23 transitions, 60 flow [2021-03-26 00:35:37,145 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2021-03-26 00:35:37,145 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -11 predicate places. [2021-03-26 00:35:37,146 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:37,146 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 60 flow [2021-03-26 00:35:37,146 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 60 flow [2021-03-26 00:35:37,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-26 00:35:37,157 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 00:35:37,158 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:35:37,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:35:37,160 INFO L142 LiptonReduction]: Number of co-enabled transitions 212 [2021-03-26 00:35:37,684 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:35:37,799 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:35:38,045 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:35:38,201 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:35:38,204 INFO L154 LiptonReduction]: Checked pairs total: 771 [2021-03-26 00:35:38,204 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:35:38,204 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1059 [2021-03-26 00:35:38,206 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-26 00:35:38,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:38,206 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:38,206 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:38,207 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:35:38,207 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 00:35:38,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:38,207 INFO L82 PathProgramCache]: Analyzing trace with hash -985136943, now seen corresponding path program 1 times [2021-03-26 00:35:38,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:38,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069490189] [2021-03-26 00:35:38,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:38,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:38,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:38,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069490189] [2021-03-26 00:35:38,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:38,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:35:38,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101361144] [2021-03-26 00:35:38,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:35:38,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:38,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:35:38,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:35:38,355 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 172 [2021-03-26 00:35:38,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 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 00:35:38,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:38,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 172 [2021-03-26 00:35:38,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:38,373 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-26 00:35:38,373 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 00:35:38,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 33 events. 3/33 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 1 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-26 00:35:38,374 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 3 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2021-03-26 00:35:38,374 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 72 flow [2021-03-26 00:35:38,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:35:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:35:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2021-03-26 00:35:38,376 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8856589147286822 [2021-03-26 00:35:38,376 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2021-03-26 00:35:38,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2021-03-26 00:35:38,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:38,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2021-03-26 00:35:38,378 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 00:35:38,379 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 00:35:38,379 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 00:35:38,379 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 457 transitions. [2021-03-26 00:35:38,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 72 flow [2021-03-26 00:35:38,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:35:38,380 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 71 flow [2021-03-26 00:35:38,380 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2021-03-26 00:35:38,381 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -16 predicate places. [2021-03-26 00:35:38,382 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:38,382 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 71 flow [2021-03-26 00:35:38,387 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 71 flow [2021-03-26 00:35:38,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 71 flow [2021-03-26 00:35:38,392 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-26 00:35:38,392 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 00:35:38,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 33 events. 3/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-26 00:35:38,393 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-26 00:35:38,394 INFO L154 LiptonReduction]: Checked pairs total: 233 [2021-03-26 00:35:38,394 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:35:38,395 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-26 00:35:38,395 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 71 flow [2021-03-26 00:35:38,396 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 00:35:38,396 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:38,396 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:38,396 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:35:38,396 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 00:35:38,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash 860640059, now seen corresponding path program 1 times [2021-03-26 00:35:38,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:38,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078235228] [2021-03-26 00:35:38,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:38,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:38,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:35:38,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:38,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:38,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078235228] [2021-03-26 00:35:38,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:38,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:35:38,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638001013] [2021-03-26 00:35:38,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:35:38,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:38,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:35:38,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:35:38,490 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 172 [2021-03-26 00:35:38,491 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:38,491 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:38,491 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 172 [2021-03-26 00:35:38,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:38,625 INFO L129 PetriNetUnfolder]: 263/496 cut-off events. [2021-03-26 00:35:38,625 INFO L130 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2021-03-26 00:35:38,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1053 conditions, 496 events. 263/496 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2544 event pairs, 39 based on Foata normal form. 22/497 useless extension candidates. Maximal degree in co-relation 1042. Up to 225 conditions per place. [2021-03-26 00:35:38,630 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 15 selfloop transitions, 5 changer transitions 4/37 dead transitions. [2021-03-26 00:35:38,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 149 flow [2021-03-26 00:35:38,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:35:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:35:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2021-03-26 00:35:38,633 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7805232558139535 [2021-03-26 00:35:38,633 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2021-03-26 00:35:38,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2021-03-26 00:35:38,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:38,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2021-03-26 00:35:38,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:38,636 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 00:35:38,637 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 00:35:38,637 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 71 flow. Second operand 4 states and 537 transitions. [2021-03-26 00:35:38,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 149 flow [2021-03-26 00:35:38,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:35:38,639 INFO L241 Difference]: Finished difference. Result has 36 places, 27 transitions, 104 flow [2021-03-26 00:35:38,640 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2021-03-26 00:35:38,640 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -12 predicate places. [2021-03-26 00:35:38,640 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:38,640 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 27 transitions, 104 flow [2021-03-26 00:35:38,640 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 27 transitions, 104 flow [2021-03-26 00:35:38,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 27 transitions, 104 flow [2021-03-26 00:35:38,654 INFO L129 PetriNetUnfolder]: 18/89 cut-off events. [2021-03-26 00:35:38,654 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-03-26 00:35:38,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 89 events. 18/89 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 458 event pairs, 3 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 170. Up to 33 conditions per place. [2021-03-26 00:35:38,656 INFO L142 LiptonReduction]: Number of co-enabled transitions 286 [2021-03-26 00:35:38,849 INFO L154 LiptonReduction]: Checked pairs total: 182 [2021-03-26 00:35:38,849 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:35:38,850 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 210 [2021-03-26 00:35:38,850 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 104 flow [2021-03-26 00:35:38,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:38,851 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:38,851 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:38,851 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:35:38,851 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 00:35:38,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:38,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1122954413, now seen corresponding path program 2 times [2021-03-26 00:35:38,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:38,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324344036] [2021-03-26 00:35:38,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:39,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:39,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:35:39,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:39,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:35:39,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:39,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:35:39,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:39,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:35:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:39,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324344036] [2021-03-26 00:35:39,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:39,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:35:39,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838617788] [2021-03-26 00:35:39,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:35:39,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:39,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:35:39,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:35:39,070 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 172 [2021-03-26 00:35:39,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 104 flow. Second operand has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:39,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:39,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 172 [2021-03-26 00:35:39,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:39,233 INFO L129 PetriNetUnfolder]: 280/552 cut-off events. [2021-03-26 00:35:39,233 INFO L130 PetriNetUnfolder]: For 375/411 co-relation queries the response was YES. [2021-03-26 00:35:39,235 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 552 events. 280/552 cut-off events. For 375/411 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3062 event pairs, 114 based on Foata normal form. 19/563 useless extension candidates. Maximal degree in co-relation 1407. Up to 413 conditions per place. [2021-03-26 00:35:39,239 INFO L132 encePairwiseOnDemand]: 164/172 looper letters, 14 selfloop transitions, 20 changer transitions 8/55 dead transitions. [2021-03-26 00:35:39,239 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 313 flow [2021-03-26 00:35:39,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:35:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:35:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 771 transitions. [2021-03-26 00:35:39,242 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.747093023255814 [2021-03-26 00:35:39,242 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 771 transitions. [2021-03-26 00:35:39,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 771 transitions. [2021-03-26 00:35:39,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:39,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 771 transitions. [2021-03-26 00:35:39,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:39,247 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 00:35:39,248 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 00:35:39,248 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 104 flow. Second operand 6 states and 771 transitions. [2021-03-26 00:35:39,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 313 flow [2021-03-26 00:35:39,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 309 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:35:39,252 INFO L241 Difference]: Finished difference. Result has 44 places, 43 transitions, 245 flow [2021-03-26 00:35:39,252 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2021-03-26 00:35:39,252 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2021-03-26 00:35:39,252 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:39,253 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 43 transitions, 245 flow [2021-03-26 00:35:39,253 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 43 transitions, 245 flow [2021-03-26 00:35:39,254 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 245 flow [2021-03-26 00:35:39,280 INFO L129 PetriNetUnfolder]: 64/207 cut-off events. [2021-03-26 00:35:39,280 INFO L130 PetriNetUnfolder]: For 311/332 co-relation queries the response was YES. [2021-03-26 00:35:39,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 207 events. 64/207 cut-off events. For 311/332 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1175 event pairs, 11 based on Foata normal form. 3/195 useless extension candidates. Maximal degree in co-relation 572. Up to 80 conditions per place. [2021-03-26 00:35:39,283 INFO L142 LiptonReduction]: Number of co-enabled transitions 336 [2021-03-26 00:35:39,375 INFO L154 LiptonReduction]: Checked pairs total: 145 [2021-03-26 00:35:39,375 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:35:39,375 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 123 [2021-03-26 00:35:39,376 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 245 flow [2021-03-26 00:35:39,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:39,377 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:39,377 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:39,377 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:35:39,377 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 00:35:39,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:39,378 INFO L82 PathProgramCache]: Analyzing trace with hash -152123389, now seen corresponding path program 1 times [2021-03-26 00:35:39,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:39,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640472110] [2021-03-26 00:35:39,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:39,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:39,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:35:39,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:39,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:35:39,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:39,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:35:39,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:39,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:35:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:39,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640472110] [2021-03-26 00:35:39,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:39,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:35:39,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891044841] [2021-03-26 00:35:39,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:35:39,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:39,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:35:39,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:35:39,474 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 172 [2021-03-26 00:35:39,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 245 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 00:35:39,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:39,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 172 [2021-03-26 00:35:39,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:39,626 INFO L129 PetriNetUnfolder]: 258/582 cut-off events. [2021-03-26 00:35:39,626 INFO L130 PetriNetUnfolder]: For 1195/1228 co-relation queries the response was YES. [2021-03-26 00:35:39,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1836 conditions, 582 events. 258/582 cut-off events. For 1195/1228 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3793 event pairs, 31 based on Foata normal form. 30/601 useless extension candidates. Maximal degree in co-relation 1817. Up to 292 conditions per place. [2021-03-26 00:35:39,631 INFO L132 encePairwiseOnDemand]: 165/172 looper letters, 21 selfloop transitions, 17 changer transitions 0/51 dead transitions. [2021-03-26 00:35:39,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 360 flow [2021-03-26 00:35:39,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:35:39,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:35:39,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2021-03-26 00:35:39,634 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7369186046511628 [2021-03-26 00:35:39,634 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions. [2021-03-26 00:35:39,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions. [2021-03-26 00:35:39,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:39,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions. [2021-03-26 00:35:39,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:39,637 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 00:35:39,637 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 00:35:39,637 INFO L185 Difference]: Start difference. First operand has 44 places, 43 transitions, 245 flow. Second operand 4 states and 507 transitions. [2021-03-26 00:35:39,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 360 flow [2021-03-26 00:35:39,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 360 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:35:39,643 INFO L241 Difference]: Finished difference. Result has 49 places, 48 transitions, 351 flow [2021-03-26 00:35:39,644 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=351, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2021-03-26 00:35:39,644 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2021-03-26 00:35:39,644 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:39,644 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 48 transitions, 351 flow [2021-03-26 00:35:39,644 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 48 transitions, 351 flow [2021-03-26 00:35:39,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 48 transitions, 351 flow [2021-03-26 00:35:39,739 INFO L129 PetriNetUnfolder]: 137/377 cut-off events. [2021-03-26 00:35:39,739 INFO L130 PetriNetUnfolder]: For 969/985 co-relation queries the response was YES. [2021-03-26 00:35:39,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 377 events. 137/377 cut-off events. For 969/985 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2474 event pairs, 17 based on Foata normal form. 2/343 useless extension candidates. Maximal degree in co-relation 1291. Up to 173 conditions per place. [2021-03-26 00:35:39,743 INFO L142 LiptonReduction]: Number of co-enabled transitions 352 [2021-03-26 00:35:39,753 INFO L154 LiptonReduction]: Checked pairs total: 97 [2021-03-26 00:35:39,753 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:35:39,754 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 110 [2021-03-26 00:35:39,760 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 351 flow [2021-03-26 00:35:39,760 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 00:35:39,760 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:39,760 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:39,760 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:35:39,761 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 00:35:39,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:39,761 INFO L82 PathProgramCache]: Analyzing trace with hash -451849277, now seen corresponding path program 2 times [2021-03-26 00:35:39,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:39,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496369437] [2021-03-26 00:35:39,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:39,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:39,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:35:39,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:39,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:35:39,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:39,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:39,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496369437] [2021-03-26 00:35:39,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:39,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:35:39,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743715364] [2021-03-26 00:35:39,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:35:39,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:39,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:35:39,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:35:39,888 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 172 [2021-03-26 00:35:39,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 351 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 00:35:39,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:39,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 172 [2021-03-26 00:35:39,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:40,086 INFO L129 PetriNetUnfolder]: 286/680 cut-off events. [2021-03-26 00:35:40,087 INFO L130 PetriNetUnfolder]: For 1871/1912 co-relation queries the response was YES. [2021-03-26 00:35:40,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2610 conditions, 680 events. 286/680 cut-off events. For 1871/1912 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4746 event pairs, 31 based on Foata normal form. 39/705 useless extension candidates. Maximal degree in co-relation 2587. Up to 259 conditions per place. [2021-03-26 00:35:40,092 INFO L132 encePairwiseOnDemand]: 165/172 looper letters, 43 selfloop transitions, 17 changer transitions 6/79 dead transitions. [2021-03-26 00:35:40,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 743 flow [2021-03-26 00:35:40,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:35:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:35:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2021-03-26 00:35:40,095 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2021-03-26 00:35:40,095 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2021-03-26 00:35:40,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2021-03-26 00:35:40,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:40,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2021-03-26 00:35:40,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:40,098 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 00:35:40,098 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 00:35:40,099 INFO L185 Difference]: Start difference. First operand has 49 places, 48 transitions, 351 flow. Second operand 5 states and 640 transitions. [2021-03-26 00:35:40,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 743 flow [2021-03-26 00:35:40,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 715 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-03-26 00:35:40,107 INFO L241 Difference]: Finished difference. Result has 54 places, 57 transitions, 507 flow [2021-03-26 00:35:40,107 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=507, PETRI_PLACES=54, PETRI_TRANSITIONS=57} [2021-03-26 00:35:40,107 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2021-03-26 00:35:40,107 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:40,108 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 57 transitions, 507 flow [2021-03-26 00:35:40,108 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 57 transitions, 507 flow [2021-03-26 00:35:40,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 57 transitions, 507 flow [2021-03-26 00:35:40,168 INFO L129 PetriNetUnfolder]: 140/449 cut-off events. [2021-03-26 00:35:40,168 INFO L130 PetriNetUnfolder]: For 1355/1383 co-relation queries the response was YES. [2021-03-26 00:35:40,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 449 events. 140/449 cut-off events. For 1355/1383 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3286 event pairs, 21 based on Foata normal form. 8/426 useless extension candidates. Maximal degree in co-relation 1555. Up to 190 conditions per place. [2021-03-26 00:35:40,173 INFO L142 LiptonReduction]: Number of co-enabled transitions 374 [2021-03-26 00:35:40,188 INFO L154 LiptonReduction]: Checked pairs total: 144 [2021-03-26 00:35:40,188 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:35:40,188 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 81 [2021-03-26 00:35:40,190 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 57 transitions, 507 flow [2021-03-26 00:35:40,190 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 00:35:40,190 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:40,190 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:40,190 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:35:40,190 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 00:35:40,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:40,191 INFO L82 PathProgramCache]: Analyzing trace with hash 129120690, now seen corresponding path program 1 times [2021-03-26 00:35:40,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:40,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135332950] [2021-03-26 00:35:40,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:40,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:40,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:35:40,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:40,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:40,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135332950] [2021-03-26 00:35:40,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:40,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:35:40,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180305797] [2021-03-26 00:35:40,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:35:40,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:40,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:35:40,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:35:40,285 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 172 [2021-03-26 00:35:40,285 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 57 transitions, 507 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 00:35:40,285 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:40,286 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 172 [2021-03-26 00:35:40,286 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:40,396 INFO L129 PetriNetUnfolder]: 232/721 cut-off events. [2021-03-26 00:35:40,396 INFO L130 PetriNetUnfolder]: For 2613/2685 co-relation queries the response was YES. [2021-03-26 00:35:40,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2548 conditions, 721 events. 232/721 cut-off events. For 2613/2685 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5829 event pairs, 25 based on Foata normal form. 34/711 useless extension candidates. Maximal degree in co-relation 2522. Up to 338 conditions per place. [2021-03-26 00:35:40,400 INFO L132 encePairwiseOnDemand]: 169/172 looper letters, 3 selfloop transitions, 3 changer transitions 12/57 dead transitions. [2021-03-26 00:35:40,400 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 519 flow [2021-03-26 00:35:40,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:35:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:35:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2021-03-26 00:35:40,403 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8837209302325582 [2021-03-26 00:35:40,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 456 transitions. [2021-03-26 00:35:40,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 456 transitions. [2021-03-26 00:35:40,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:40,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 456 transitions. [2021-03-26 00:35:40,404 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 00:35:40,405 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 00:35:40,405 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 00:35:40,406 INFO L185 Difference]: Start difference. First operand has 54 places, 57 transitions, 507 flow. Second operand 3 states and 456 transitions. [2021-03-26 00:35:40,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 519 flow [2021-03-26 00:35:40,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 516 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:35:40,412 INFO L241 Difference]: Finished difference. Result has 56 places, 45 transitions, 391 flow [2021-03-26 00:35:40,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2021-03-26 00:35:40,412 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2021-03-26 00:35:40,412 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:40,413 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 391 flow [2021-03-26 00:35:40,413 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 391 flow [2021-03-26 00:35:40,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 391 flow [2021-03-26 00:35:40,463 INFO L129 PetriNetUnfolder]: 125/379 cut-off events. [2021-03-26 00:35:40,463 INFO L130 PetriNetUnfolder]: For 1175/1185 co-relation queries the response was YES. [2021-03-26 00:35:40,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 379 events. 125/379 cut-off events. For 1175/1185 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2460 event pairs, 11 based on Foata normal form. 5/366 useless extension candidates. Maximal degree in co-relation 1348. Up to 169 conditions per place. [2021-03-26 00:35:40,467 INFO L142 LiptonReduction]: Number of co-enabled transitions 306 [2021-03-26 00:35:42,138 WARN L205 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 368 DAG size of output: 328 [2021-03-26 00:35:42,867 WARN L205 SmtUtils]: Spent 723.00 ms on a formula simplification that was a NOOP. DAG size: 315 [2021-03-26 00:35:46,691 WARN L205 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 531 DAG size of output: 487 [2021-03-26 00:35:48,496 WARN L205 SmtUtils]: Spent 1.80 s on a formula simplification that was a NOOP. DAG size: 473 [2021-03-26 00:35:50,866 WARN L205 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 382 DAG size of output: 357 [2021-03-26 00:35:51,957 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 352 [2021-03-26 00:35:57,909 WARN L205 SmtUtils]: Spent 5.95 s on a formula simplification. DAG size of input: 564 DAG size of output: 538 [2021-03-26 00:36:00,703 WARN L205 SmtUtils]: Spent 2.79 s on a formula simplification that was a NOOP. DAG size: 532 [2021-03-26 00:36:00,717 INFO L154 LiptonReduction]: Checked pairs total: 356 [2021-03-26 00:36:00,717 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:36:00,717 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20305 [2021-03-26 00:36:00,718 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 405 flow [2021-03-26 00:36:00,718 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 00:36:00,718 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:00,718 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:00,718 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:36:00,719 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 00:36:00,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:00,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1143357981, now seen corresponding path program 1 times [2021-03-26 00:36:00,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:00,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792734078] [2021-03-26 00:36:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:00,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:00,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:36:00,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:00,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:36:00,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:00,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:36:00,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:00,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:36:00,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:00,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:36:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:00,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792734078] [2021-03-26 00:36:00,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:00,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:36:00,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509490175] [2021-03-26 00:36:00,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:36:00,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:00,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:36:00,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:36:00,829 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 174 [2021-03-26 00:36:00,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 405 flow. Second operand has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,829 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:00,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 174 [2021-03-26 00:36:00,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:01,056 INFO L129 PetriNetUnfolder]: 254/603 cut-off events. [2021-03-26 00:36:01,056 INFO L130 PetriNetUnfolder]: For 2035/2091 co-relation queries the response was YES. [2021-03-26 00:36:01,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2382 conditions, 603 events. 254/603 cut-off events. For 2035/2091 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4040 event pairs, 49 based on Foata normal form. 26/618 useless extension candidates. Maximal degree in co-relation 2355. Up to 379 conditions per place. [2021-03-26 00:36:01,060 INFO L132 encePairwiseOnDemand]: 167/174 looper letters, 25 selfloop transitions, 14 changer transitions 0/52 dead transitions. [2021-03-26 00:36:01,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 52 transitions, 526 flow [2021-03-26 00:36:01,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:36:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:36:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2021-03-26 00:36:01,064 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7701149425287356 [2021-03-26 00:36:01,064 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2021-03-26 00:36:01,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2021-03-26 00:36:01,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:01,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2021-03-26 00:36:01,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:01,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:01,067 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:01,067 INFO L185 Difference]: Start difference. First operand has 56 places, 45 transitions, 405 flow. Second operand 4 states and 536 transitions. [2021-03-26 00:36:01,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 52 transitions, 526 flow [2021-03-26 00:36:01,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 445 flow, removed 16 selfloop flow, removed 6 redundant places. [2021-03-26 00:36:01,072 INFO L241 Difference]: Finished difference. Result has 54 places, 49 transitions, 404 flow [2021-03-26 00:36:01,072 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=404, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2021-03-26 00:36:01,072 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2021-03-26 00:36:01,072 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:01,073 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 49 transitions, 404 flow [2021-03-26 00:36:01,073 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 49 transitions, 404 flow [2021-03-26 00:36:01,073 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 49 transitions, 404 flow [2021-03-26 00:36:01,133 INFO L129 PetriNetUnfolder]: 159/466 cut-off events. [2021-03-26 00:36:01,133 INFO L130 PetriNetUnfolder]: For 1487/1541 co-relation queries the response was YES. [2021-03-26 00:36:01,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 466 events. 159/466 cut-off events. For 1487/1541 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3265 event pairs, 23 based on Foata normal form. 10/438 useless extension candidates. Maximal degree in co-relation 1679. Up to 217 conditions per place. [2021-03-26 00:36:01,139 INFO L142 LiptonReduction]: Number of co-enabled transitions 340 [2021-03-26 00:36:01,154 INFO L154 LiptonReduction]: Checked pairs total: 170 [2021-03-26 00:36:01,155 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:36:01,155 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 83 [2021-03-26 00:36:01,155 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 404 flow [2021-03-26 00:36:01,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:01,156 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:01,156 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:01,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:36:01,156 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 00:36:01,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:01,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1418137474, now seen corresponding path program 1 times [2021-03-26 00:36:01,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:01,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288329515] [2021-03-26 00:36:01,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:01,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:01,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:36:01,297 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-26 00:36:01,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 00:36:01,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:01,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:36:01,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:01,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:36:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:01,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288329515] [2021-03-26 00:36:01,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:01,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:36:01,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070028327] [2021-03-26 00:36:01,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:36:01,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:01,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:36:01,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:36:01,345 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 174 [2021-03-26 00:36:01,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:01,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:01,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 174 [2021-03-26 00:36:01,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:01,616 INFO L129 PetriNetUnfolder]: 263/682 cut-off events. [2021-03-26 00:36:01,617 INFO L130 PetriNetUnfolder]: For 1843/1900 co-relation queries the response was YES. [2021-03-26 00:36:01,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 682 events. 263/682 cut-off events. For 1843/1900 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 4997 event pairs, 38 based on Foata normal form. 46/717 useless extension candidates. Maximal degree in co-relation 2680. Up to 338 conditions per place. [2021-03-26 00:36:01,621 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 20 selfloop transitions, 12 changer transitions 17/62 dead transitions. [2021-03-26 00:36:01,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 614 flow [2021-03-26 00:36:01,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:36:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:36:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2021-03-26 00:36:01,624 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7206896551724138 [2021-03-26 00:36:01,624 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2021-03-26 00:36:01,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2021-03-26 00:36:01,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:01,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2021-03-26 00:36:01,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:01,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:01,629 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:01,629 INFO L185 Difference]: Start difference. First operand has 54 places, 49 transitions, 404 flow. Second operand 5 states and 627 transitions. [2021-03-26 00:36:01,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 614 flow [2021-03-26 00:36:01,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 589 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-26 00:36:01,634 INFO L241 Difference]: Finished difference. Result has 58 places, 42 transitions, 376 flow [2021-03-26 00:36:01,634 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=376, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2021-03-26 00:36:01,634 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2021-03-26 00:36:01,635 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:01,635 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 42 transitions, 376 flow [2021-03-26 00:36:01,635 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 42 transitions, 376 flow [2021-03-26 00:36:01,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 42 transitions, 376 flow [2021-03-26 00:36:01,685 INFO L129 PetriNetUnfolder]: 101/363 cut-off events. [2021-03-26 00:36:01,686 INFO L130 PetriNetUnfolder]: For 1366/1405 co-relation queries the response was YES. [2021-03-26 00:36:01,687 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 363 events. 101/363 cut-off events. For 1366/1405 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2584 event pairs, 21 based on Foata normal form. 9/351 useless extension candidates. Maximal degree in co-relation 1323. Up to 138 conditions per place. [2021-03-26 00:36:01,690 INFO L142 LiptonReduction]: Number of co-enabled transitions 290 [2021-03-26 00:36:01,700 INFO L154 LiptonReduction]: Checked pairs total: 128 [2021-03-26 00:36:01,701 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:36:01,701 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 66 [2021-03-26 00:36:01,701 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 376 flow [2021-03-26 00:36:01,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:01,702 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:01,702 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:01,702 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:36:01,702 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 00:36:01,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:01,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1477921358, now seen corresponding path program 1 times [2021-03-26 00:36:01,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:01,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744113970] [2021-03-26 00:36:01,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:01,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:01,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:36:01,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:01,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:36:01,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:01,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:36:01,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:01,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:36:01,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:01,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:36:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:01,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744113970] [2021-03-26 00:36:01,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:01,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:36:01,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493978482] [2021-03-26 00:36:01,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:36:01,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:01,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:36:01,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:36:01,877 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 174 [2021-03-26 00:36:01,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 376 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:01,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:01,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 174 [2021-03-26 00:36:01,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:02,153 INFO L129 PetriNetUnfolder]: 246/578 cut-off events. [2021-03-26 00:36:02,153 INFO L130 PetriNetUnfolder]: For 2034/2083 co-relation queries the response was YES. [2021-03-26 00:36:02,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 578 events. 246/578 cut-off events. For 2034/2083 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3808 event pairs, 90 based on Foata normal form. 33/608 useless extension candidates. Maximal degree in co-relation 2364. Up to 375 conditions per place. [2021-03-26 00:36:02,157 INFO L132 encePairwiseOnDemand]: 166/174 looper letters, 28 selfloop transitions, 17 changer transitions 7/65 dead transitions. [2021-03-26 00:36:02,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 65 transitions, 652 flow [2021-03-26 00:36:02,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:36:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:36:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 741 transitions. [2021-03-26 00:36:02,161 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7097701149425287 [2021-03-26 00:36:02,162 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 741 transitions. [2021-03-26 00:36:02,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 741 transitions. [2021-03-26 00:36:02,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:02,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 741 transitions. [2021-03-26 00:36:02,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:02,165 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 00:36:02,166 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 00:36:02,166 INFO L185 Difference]: Start difference. First operand has 56 places, 42 transitions, 376 flow. Second operand 6 states and 741 transitions. [2021-03-26 00:36:02,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 65 transitions, 652 flow [2021-03-26 00:36:02,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 591 flow, removed 9 selfloop flow, removed 7 redundant places. [2021-03-26 00:36:02,171 INFO L241 Difference]: Finished difference. Result has 58 places, 48 transitions, 446 flow [2021-03-26 00:36:02,171 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2021-03-26 00:36:02,171 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2021-03-26 00:36:02,171 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:02,171 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 48 transitions, 446 flow [2021-03-26 00:36:02,172 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 48 transitions, 446 flow [2021-03-26 00:36:02,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 48 transitions, 446 flow [2021-03-26 00:36:02,232 INFO L129 PetriNetUnfolder]: 126/441 cut-off events. [2021-03-26 00:36:02,233 INFO L130 PetriNetUnfolder]: For 1615/1640 co-relation queries the response was YES. [2021-03-26 00:36:02,235 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1706 conditions, 441 events. 126/441 cut-off events. For 1615/1640 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3173 event pairs, 10 based on Foata normal form. 11/444 useless extension candidates. Maximal degree in co-relation 1680. Up to 145 conditions per place. [2021-03-26 00:36:02,238 INFO L142 LiptonReduction]: Number of co-enabled transitions 332 [2021-03-26 00:36:03,700 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2021-03-26 00:36:04,294 WARN L205 SmtUtils]: Spent 592.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-26 00:36:07,260 WARN L205 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-26 00:36:08,621 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 305 [2021-03-26 00:36:09,113 INFO L154 LiptonReduction]: Checked pairs total: 344 [2021-03-26 00:36:09,113 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:36:09,114 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6943 [2021-03-26 00:36:09,114 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 442 flow [2021-03-26 00:36:09,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:09,115 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:09,115 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:09,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:36:09,115 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 00:36:09,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash 411015281, now seen corresponding path program 2 times [2021-03-26 00:36:09,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:09,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542596802] [2021-03-26 00:36:09,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:09,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:09,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:36:09,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:09,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:36:09,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:09,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:36:09,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:09,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 00:36:09,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:09,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 00:36:09,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:09,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 00:36:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:09,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542596802] [2021-03-26 00:36:09,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:09,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:36:09,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485970782] [2021-03-26 00:36:09,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:36:09,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:09,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:36:09,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:36:09,338 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 175 [2021-03-26 00:36:09,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 442 flow. Second operand has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:09,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:09,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 175 [2021-03-26 00:36:09,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:09,768 INFO L129 PetriNetUnfolder]: 226/571 cut-off events. [2021-03-26 00:36:09,768 INFO L130 PetriNetUnfolder]: For 2207/2246 co-relation queries the response was YES. [2021-03-26 00:36:09,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 571 events. 226/571 cut-off events. For 2207/2246 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 3998 event pairs, 46 based on Foata normal form. 23/592 useless extension candidates. Maximal degree in co-relation 2435. Up to 201 conditions per place. [2021-03-26 00:36:09,772 INFO L132 encePairwiseOnDemand]: 166/175 looper letters, 27 selfloop transitions, 19 changer transitions 4/63 dead transitions. [2021-03-26 00:36:09,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 682 flow [2021-03-26 00:36:09,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:36:09,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:36:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2021-03-26 00:36:09,777 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6824489795918367 [2021-03-26 00:36:09,777 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2021-03-26 00:36:09,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2021-03-26 00:36:09,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:09,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2021-03-26 00:36:09,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:09,781 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 00:36:09,782 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 00:36:09,782 INFO L185 Difference]: Start difference. First operand has 57 places, 47 transitions, 442 flow. Second operand 7 states and 836 transitions. [2021-03-26 00:36:09,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 682 flow [2021-03-26 00:36:09,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 63 transitions, 660 flow, removed 11 selfloop flow, removed 1 redundant places. [2021-03-26 00:36:09,790 INFO L241 Difference]: Finished difference. Result has 64 places, 51 transitions, 544 flow [2021-03-26 00:36:09,790 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=544, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2021-03-26 00:36:09,790 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2021-03-26 00:36:09,790 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:09,790 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 51 transitions, 544 flow [2021-03-26 00:36:09,790 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 51 transitions, 544 flow [2021-03-26 00:36:09,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 51 transitions, 544 flow [2021-03-26 00:36:09,851 INFO L129 PetriNetUnfolder]: 117/423 cut-off events. [2021-03-26 00:36:09,851 INFO L130 PetriNetUnfolder]: For 1872/1882 co-relation queries the response was YES. [2021-03-26 00:36:09,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 423 events. 117/423 cut-off events. For 1872/1882 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3075 event pairs, 5 based on Foata normal form. 7/425 useless extension candidates. Maximal degree in co-relation 1775. Up to 133 conditions per place. [2021-03-26 00:36:09,857 INFO L142 LiptonReduction]: Number of co-enabled transitions 342 [2021-03-26 00:36:10,129 INFO L154 LiptonReduction]: Checked pairs total: 232 [2021-03-26 00:36:10,129 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:36:10,129 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 339 [2021-03-26 00:36:10,131 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 544 flow [2021-03-26 00:36:10,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:10,131 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:10,131 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:10,131 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:36:10,132 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 00:36:10,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:10,132 INFO L82 PathProgramCache]: Analyzing trace with hash -161714500, now seen corresponding path program 1 times [2021-03-26 00:36:10,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:10,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487642385] [2021-03-26 00:36:10,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:10,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:10,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:36:10,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:10,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:36:10,258 INFO L142 QuantifierPusher]: treesize reduction 26, result has 66.7 percent of original size [2021-03-26 00:36:10,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-26 00:36:10,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:10,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 00:36:10,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:10,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:36:10,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:10,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:36:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:10,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487642385] [2021-03-26 00:36:10,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:10,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:36:10,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058898135] [2021-03-26 00:36:10,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:36:10,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:10,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:36:10,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:36:10,449 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 175 [2021-03-26 00:36:10,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 544 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 00:36:10,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:10,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 175 [2021-03-26 00:36:10,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:10,808 INFO L129 PetriNetUnfolder]: 218/552 cut-off events. [2021-03-26 00:36:10,808 INFO L130 PetriNetUnfolder]: For 2915/2953 co-relation queries the response was YES. [2021-03-26 00:36:10,810 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2586 conditions, 552 events. 218/552 cut-off events. For 2915/2953 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 3824 event pairs, 96 based on Foata normal form. 22/571 useless extension candidates. Maximal degree in co-relation 2555. Up to 361 conditions per place. [2021-03-26 00:36:10,812 INFO L132 encePairwiseOnDemand]: 167/175 looper letters, 28 selfloop transitions, 19 changer transitions 8/68 dead transitions. [2021-03-26 00:36:10,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 789 flow [2021-03-26 00:36:10,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:36:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:36:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 768 transitions. [2021-03-26 00:36:10,817 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7314285714285714 [2021-03-26 00:36:10,817 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 768 transitions. [2021-03-26 00:36:10,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 768 transitions. [2021-03-26 00:36:10,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:10,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 768 transitions. [2021-03-26 00:36:10,819 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 00:36:10,820 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 00:36:10,821 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 00:36:10,821 INFO L185 Difference]: Start difference. First operand has 64 places, 51 transitions, 544 flow. Second operand 6 states and 768 transitions. [2021-03-26 00:36:10,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 789 flow [2021-03-26 00:36:10,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 768 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-03-26 00:36:10,828 INFO L241 Difference]: Finished difference. Result has 70 places, 56 transitions, 640 flow [2021-03-26 00:36:10,828 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=640, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2021-03-26 00:36:10,828 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2021-03-26 00:36:10,828 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:10,829 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 56 transitions, 640 flow [2021-03-26 00:36:10,829 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 56 transitions, 640 flow [2021-03-26 00:36:10,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 56 transitions, 640 flow [2021-03-26 00:36:10,882 INFO L129 PetriNetUnfolder]: 105/354 cut-off events. [2021-03-26 00:36:10,882 INFO L130 PetriNetUnfolder]: For 2495/2545 co-relation queries the response was YES. [2021-03-26 00:36:10,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 354 events. 105/354 cut-off events. For 2495/2545 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2414 event pairs, 28 based on Foata normal form. 11/342 useless extension candidates. Maximal degree in co-relation 1635. Up to 127 conditions per place. [2021-03-26 00:36:10,887 INFO L142 LiptonReduction]: Number of co-enabled transitions 366 [2021-03-26 00:36:10,903 INFO L154 LiptonReduction]: Checked pairs total: 330 [2021-03-26 00:36:10,903 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:36:10,904 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 75 [2021-03-26 00:36:10,904 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 640 flow [2021-03-26 00:36:10,904 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 00:36:10,905 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:10,905 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:10,905 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:36:10,905 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 00:36:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:10,905 INFO L82 PathProgramCache]: Analyzing trace with hash -906806013, now seen corresponding path program 1 times [2021-03-26 00:36:10,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:10,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135978972] [2021-03-26 00:36:10,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:10,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:10,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:36:10,972 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:36:10,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:36:10,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:10,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:36:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:10,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135978972] [2021-03-26 00:36:10,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:10,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:36:10,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11317345] [2021-03-26 00:36:10,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:36:10,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:10,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:36:10,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:36:10,994 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 175 [2021-03-26 00:36:10,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 640 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:10,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:10,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 175 [2021-03-26 00:36:10,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:11,136 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1669] L860-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse19 (= (mod v_~y$w_buff1_used~0_779 256) 0)) (.cse17 (= (mod v_~y$r_buff1_thd0~0_288 256) 0)) (.cse14 (= (mod v_~y$r_buff0_thd0~0_341 256) 0))) (let ((.cse15 (not .cse14)) (.cse4 (and .cse14 .cse17)) (.cse18 (= (mod v_~y$w_buff0_used~0_953 256) 0)) (.cse5 (and .cse14 .cse19)) (.cse0 (= (mod v_~weak$$choice2~0_310 256) 0))) (let ((.cse2 (not .cse0)) (.cse10 (or .cse4 .cse18 .cse5)) (.cse7 (or .cse15 (not .cse19))) (.cse11 (not .cse18)) (.cse8 (or .cse15 (not .cse17)))) (and (= (mod v_~main$tmp_guard1~0_70 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_25|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_33 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_25|) (= v_~weak$$choice2~0_310 |v_ULTIMATE.start_main_#t~nondet79_121|) (let ((.cse1 (= |v_ULTIMATE.start_main_#t~ite97_184| |v_ULTIMATE.start_main_#t~ite97_183|))) (or (and .cse0 (= v_~y$r_buff1_thd0~0_287 |v_ULTIMATE.start_main_#t~ite98_180|) .cse1 (= v_~y$r_buff1_thd0~0_288 |v_ULTIMATE.start_main_#t~ite98_180|)) (and (= |v_ULTIMATE.start_main_#t~ite98_180| |v_ULTIMATE.start_main_#t~ite98_179|) (= v_~y$r_buff1_thd0~0_288 v_~y$r_buff1_thd0~0_287) .cse1 .cse2))) (or (and .cse0 (= v_~y~0_507 v_~y~0_505)) (and (= v_~y~0_505 v_~y$mem_tmp~0_138) .cse2)) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~ite91_172| |v_ULTIMATE.start_main_#t~ite91_171|))) (or (and .cse0 (let ((.cse3 (= (mod v_~y$w_buff0_used~0_952 256) 0))) (or (and (or .cse3 .cse4 .cse5) (= v_~y$w_buff1_used~0_779 |v_ULTIMATE.start_main_#t~ite92_160|) .cse6) (and .cse7 (not .cse3) .cse8 (= |v_ULTIMATE.start_main_#t~ite91_172| |v_ULTIMATE.start_main_#t~ite92_160|) (= |v_ULTIMATE.start_main_#t~ite91_172| 0)))) (= v_~y$w_buff1_used~0_778 |v_ULTIMATE.start_main_#t~ite92_160|)) (and (= v_~y$w_buff1_used~0_779 v_~y$w_buff1_used~0_778) (= |v_ULTIMATE.start_main_#t~ite92_160| |v_ULTIMATE.start_main_#t~ite92_159|) .cse2 .cse6))) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite85_162| |v_ULTIMATE.start_main_#t~ite85_161|))) (or (and .cse9 (= |v_ULTIMATE.start_main_#t~ite86_152| |v_ULTIMATE.start_main_#t~ite86_151|) (= v_~y$w_buff1~0_367 v_~y$w_buff1~0_366) .cse2) (and .cse0 (or (and .cse9 .cse10 (= v_~y$w_buff1~0_367 |v_ULTIMATE.start_main_#t~ite86_152|)) (and (= v_~y$w_buff1~0_367 |v_ULTIMATE.start_main_#t~ite85_162|) (= |v_ULTIMATE.start_main_#t~ite85_162| |v_ULTIMATE.start_main_#t~ite86_152|) .cse7 .cse11 .cse8)) (= v_~y$w_buff1~0_366 |v_ULTIMATE.start_main_#t~ite86_152|)))) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite94_169| |v_ULTIMATE.start_main_#t~ite94_170|))) (or (and (= v_~y$r_buff0_thd0~0_341 v_~y$r_buff0_thd0~0_340) (= |v_ULTIMATE.start_main_#t~ite95_165| |v_ULTIMATE.start_main_#t~ite95_166|) .cse12 .cse2) (and .cse0 (= v_~y$r_buff0_thd0~0_341 |v_ULTIMATE.start_main_#t~ite95_166|) (= v_~y$r_buff0_thd0~0_340 |v_ULTIMATE.start_main_#t~ite95_166|) .cse12))) (= v_~weak$$choice0~0_105 |v_ULTIMATE.start_main_#t~nondet78_115|) (= (ite (= (ite (not (and (= v_~y~0_507 2) (= v_~__unbuffered_p2_EBX~0_80 1) (= v_~__unbuffered_p2_EAX~0_81 1) (= v_~x~0_78 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_70) (= v_~y$flush_delayed~0_194 0) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite88_159| |v_ULTIMATE.start_main_#t~ite88_160|))) (or (and .cse13 (= v_~y$w_buff0_used~0_953 v_~y$w_buff0_used~0_952) (= |v_ULTIMATE.start_main_#t~ite89_156| |v_ULTIMATE.start_main_#t~ite89_155|) .cse2) (and .cse0 (= v_~y$w_buff0_used~0_952 |v_ULTIMATE.start_main_#t~ite89_156|) (or (and (= |v_ULTIMATE.start_main_#t~ite88_160| |v_ULTIMATE.start_main_#t~ite89_156|) .cse7 .cse11 .cse8 (or (and .cse14 (= v_~y$w_buff0_used~0_953 |v_ULTIMATE.start_main_#t~ite88_160|)) (and (= |v_ULTIMATE.start_main_#t~ite88_160| 0) .cse15))) (and .cse10 .cse13 (= v_~y$w_buff0_used~0_953 |v_ULTIMATE.start_main_#t~ite89_156|)))))) (= v_~y~0_506 v_~y$mem_tmp~0_138) (or (and (= v_~y~0_507 |v_ULTIMATE.start_main_#t~ite80_160|) .cse7 (or (and .cse14 (= v_~y$w_buff1~0_367 |v_ULTIMATE.start_main_#t~ite80_160|)) (and .cse15 (= |v_ULTIMATE.start_main_#t~ite80_160| v_~y$w_buff0~0_379))) .cse11 .cse8) (and (= v_~y~0_507 v_~y~0_506) .cse10 (= |v_ULTIMATE.start_main_#t~ite80_159| |v_ULTIMATE.start_main_#t~ite80_160|))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_33 0) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite82_166| |v_ULTIMATE.start_main_#t~ite82_165|))) (or (and .cse16 (= v_~y$w_buff0~0_379 v_~y$w_buff0~0_378) (= |v_ULTIMATE.start_main_#t~ite83_159| |v_ULTIMATE.start_main_#t~ite83_160|) .cse2) (and .cse0 (or (and .cse16 .cse10 (= |v_ULTIMATE.start_main_#t~ite83_160| v_~y$w_buff0~0_379)) (and (= |v_ULTIMATE.start_main_#t~ite82_166| |v_ULTIMATE.start_main_#t~ite83_160|) .cse7 .cse11 (= |v_ULTIMATE.start_main_#t~ite82_166| v_~y$w_buff0~0_379) .cse8)) (= |v_ULTIMATE.start_main_#t~ite83_160| v_~y$w_buff0~0_378)))))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_953, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_121|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_115|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_155|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_159|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_151|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_165|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_169|, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_159|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_171|, ~y$w_buff0~0=v_~y$w_buff0~0_379, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_81, ~y~0=v_~y~0_506, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_179|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_183|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_161|, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_159|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_165|, ~y$w_buff1~0=v_~y$w_buff1~0_367, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_159|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_341, ~x~0=v_~x~0_78, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_288, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_779} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_952, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_120|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_114|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_70, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_154|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_158|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_68|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_150|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_78|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_164|, ~y$mem_tmp~0=v_~y$mem_tmp~0_138, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_168|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_33, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_72|, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_158|, ULTIMATE.start_main_#t~ite100=|v_ULTIMATE.start_main_#t~ite100_72|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_170|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_78|, ~y$w_buff0~0=v_~y$w_buff0~0_378, ~y$flush_delayed~0=v_~y$flush_delayed~0_194, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_81, ~y~0=v_~y~0_505, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_25|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite99=|v_ULTIMATE.start_main_#t~ite99_76|, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_178|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_182|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_160|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_70|, ~weak$$choice0~0=v_~weak$$choice0~0_105, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_158|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_164|, ~y$w_buff1~0=v_~y$w_buff1~0_366, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_70|, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_158|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_340, ~weak$$choice2~0=v_~weak$$choice2~0_310, ~x~0=v_~x~0_78, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_287, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_778} AuxVars[|v_ULTIMATE.start_main_#t~ite94_170|, v_~y~0_507, |v_ULTIMATE.start_main_#t~ite88_160|, |v_ULTIMATE.start_main_#t~ite86_152|, |v_ULTIMATE.start_main_#t~ite89_156|, |v_ULTIMATE.start_main_#t~ite97_184|, |v_ULTIMATE.start_main_#t~ite95_166|, |v_ULTIMATE.start_main_#t~ite92_160|, |v_ULTIMATE.start_main_#t~ite82_166|, |v_ULTIMATE.start_main_#t~ite85_162|, |v_ULTIMATE.start_main_#t~ite83_160|, |v_ULTIMATE.start_main_#t~ite80_160|, |v_ULTIMATE.start_main_#t~ite91_172|, |v_ULTIMATE.start_main_#t~ite98_180|] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet79, ULTIMATE.start_main_#t~nondet78, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite96, ULTIMATE.start_main_#t~ite95, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite94, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~ite100, ULTIMATE.start_main_#t~ite91, ULTIMATE.start_main_#t~ite90, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite99, ULTIMATE.start_main_#t~ite98, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#t~ite80, ~y$r_buff0_thd0~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][58], [Black: 192#(and (= ~y$r_buff1_thd0~0 0) (or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~y~0 ~__unbuffered_p2_EBX~0)) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 321#(and (or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y~0 ~__unbuffered_p2_EBX~0) (not (= 2 ~y~0))) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 11#L781true, Black: 137#(<= ~x~0 0), 273#true, Black: 205#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd3~0 0)), Black: 207#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0)), 342#true, Black: 275#(and (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 276#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 153#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0)), Black: 280#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 221#(= ~x~0 1), Black: 352#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$w_buff0_used~0 0) (or (= ~y~0 ~y$w_buff0~0) (= ~y~0 ~__unbuffered_p2_EBX~0)) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0)), 99#L827true, Black: 344#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0)), Black: 348#(and (= ~y$r_buff1_thd0~0 0) (or (= ~y~0 0) (= ~y~0 ~__unbuffered_p2_EBX~0)) (= ~y$r_buff0_thd0~0 0)), 167#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 169#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0)), 49#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 238#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 54#P0EXITtrue, 314#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 380#true, 188#(and (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 122#(= ~__unbuffered_p2_EBX~0 0)]) [2021-03-26 00:36:11,136 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 00:36:11,136 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 00:36:11,136 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 00:36:11,136 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 00:36:11,149 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1669] L860-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse19 (= (mod v_~y$w_buff1_used~0_779 256) 0)) (.cse17 (= (mod v_~y$r_buff1_thd0~0_288 256) 0)) (.cse14 (= (mod v_~y$r_buff0_thd0~0_341 256) 0))) (let ((.cse15 (not .cse14)) (.cse4 (and .cse14 .cse17)) (.cse18 (= (mod v_~y$w_buff0_used~0_953 256) 0)) (.cse5 (and .cse14 .cse19)) (.cse0 (= (mod v_~weak$$choice2~0_310 256) 0))) (let ((.cse2 (not .cse0)) (.cse10 (or .cse4 .cse18 .cse5)) (.cse7 (or .cse15 (not .cse19))) (.cse11 (not .cse18)) (.cse8 (or .cse15 (not .cse17)))) (and (= (mod v_~main$tmp_guard1~0_70 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_25|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_33 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_25|) (= v_~weak$$choice2~0_310 |v_ULTIMATE.start_main_#t~nondet79_121|) (let ((.cse1 (= |v_ULTIMATE.start_main_#t~ite97_184| |v_ULTIMATE.start_main_#t~ite97_183|))) (or (and .cse0 (= v_~y$r_buff1_thd0~0_287 |v_ULTIMATE.start_main_#t~ite98_180|) .cse1 (= v_~y$r_buff1_thd0~0_288 |v_ULTIMATE.start_main_#t~ite98_180|)) (and (= |v_ULTIMATE.start_main_#t~ite98_180| |v_ULTIMATE.start_main_#t~ite98_179|) (= v_~y$r_buff1_thd0~0_288 v_~y$r_buff1_thd0~0_287) .cse1 .cse2))) (or (and .cse0 (= v_~y~0_507 v_~y~0_505)) (and (= v_~y~0_505 v_~y$mem_tmp~0_138) .cse2)) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~ite91_172| |v_ULTIMATE.start_main_#t~ite91_171|))) (or (and .cse0 (let ((.cse3 (= (mod v_~y$w_buff0_used~0_952 256) 0))) (or (and (or .cse3 .cse4 .cse5) (= v_~y$w_buff1_used~0_779 |v_ULTIMATE.start_main_#t~ite92_160|) .cse6) (and .cse7 (not .cse3) .cse8 (= |v_ULTIMATE.start_main_#t~ite91_172| |v_ULTIMATE.start_main_#t~ite92_160|) (= |v_ULTIMATE.start_main_#t~ite91_172| 0)))) (= v_~y$w_buff1_used~0_778 |v_ULTIMATE.start_main_#t~ite92_160|)) (and (= v_~y$w_buff1_used~0_779 v_~y$w_buff1_used~0_778) (= |v_ULTIMATE.start_main_#t~ite92_160| |v_ULTIMATE.start_main_#t~ite92_159|) .cse2 .cse6))) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite85_162| |v_ULTIMATE.start_main_#t~ite85_161|))) (or (and .cse9 (= |v_ULTIMATE.start_main_#t~ite86_152| |v_ULTIMATE.start_main_#t~ite86_151|) (= v_~y$w_buff1~0_367 v_~y$w_buff1~0_366) .cse2) (and .cse0 (or (and .cse9 .cse10 (= v_~y$w_buff1~0_367 |v_ULTIMATE.start_main_#t~ite86_152|)) (and (= v_~y$w_buff1~0_367 |v_ULTIMATE.start_main_#t~ite85_162|) (= |v_ULTIMATE.start_main_#t~ite85_162| |v_ULTIMATE.start_main_#t~ite86_152|) .cse7 .cse11 .cse8)) (= v_~y$w_buff1~0_366 |v_ULTIMATE.start_main_#t~ite86_152|)))) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite94_169| |v_ULTIMATE.start_main_#t~ite94_170|))) (or (and (= v_~y$r_buff0_thd0~0_341 v_~y$r_buff0_thd0~0_340) (= |v_ULTIMATE.start_main_#t~ite95_165| |v_ULTIMATE.start_main_#t~ite95_166|) .cse12 .cse2) (and .cse0 (= v_~y$r_buff0_thd0~0_341 |v_ULTIMATE.start_main_#t~ite95_166|) (= v_~y$r_buff0_thd0~0_340 |v_ULTIMATE.start_main_#t~ite95_166|) .cse12))) (= v_~weak$$choice0~0_105 |v_ULTIMATE.start_main_#t~nondet78_115|) (= (ite (= (ite (not (and (= v_~y~0_507 2) (= v_~__unbuffered_p2_EBX~0_80 1) (= v_~__unbuffered_p2_EAX~0_81 1) (= v_~x~0_78 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_70) (= v_~y$flush_delayed~0_194 0) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite88_159| |v_ULTIMATE.start_main_#t~ite88_160|))) (or (and .cse13 (= v_~y$w_buff0_used~0_953 v_~y$w_buff0_used~0_952) (= |v_ULTIMATE.start_main_#t~ite89_156| |v_ULTIMATE.start_main_#t~ite89_155|) .cse2) (and .cse0 (= v_~y$w_buff0_used~0_952 |v_ULTIMATE.start_main_#t~ite89_156|) (or (and (= |v_ULTIMATE.start_main_#t~ite88_160| |v_ULTIMATE.start_main_#t~ite89_156|) .cse7 .cse11 .cse8 (or (and .cse14 (= v_~y$w_buff0_used~0_953 |v_ULTIMATE.start_main_#t~ite88_160|)) (and (= |v_ULTIMATE.start_main_#t~ite88_160| 0) .cse15))) (and .cse10 .cse13 (= v_~y$w_buff0_used~0_953 |v_ULTIMATE.start_main_#t~ite89_156|)))))) (= v_~y~0_506 v_~y$mem_tmp~0_138) (or (and (= v_~y~0_507 |v_ULTIMATE.start_main_#t~ite80_160|) .cse7 (or (and .cse14 (= v_~y$w_buff1~0_367 |v_ULTIMATE.start_main_#t~ite80_160|)) (and .cse15 (= |v_ULTIMATE.start_main_#t~ite80_160| v_~y$w_buff0~0_379))) .cse11 .cse8) (and (= v_~y~0_507 v_~y~0_506) .cse10 (= |v_ULTIMATE.start_main_#t~ite80_159| |v_ULTIMATE.start_main_#t~ite80_160|))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_33 0) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite82_166| |v_ULTIMATE.start_main_#t~ite82_165|))) (or (and .cse16 (= v_~y$w_buff0~0_379 v_~y$w_buff0~0_378) (= |v_ULTIMATE.start_main_#t~ite83_159| |v_ULTIMATE.start_main_#t~ite83_160|) .cse2) (and .cse0 (or (and .cse16 .cse10 (= |v_ULTIMATE.start_main_#t~ite83_160| v_~y$w_buff0~0_379)) (and (= |v_ULTIMATE.start_main_#t~ite82_166| |v_ULTIMATE.start_main_#t~ite83_160|) .cse7 .cse11 (= |v_ULTIMATE.start_main_#t~ite82_166| v_~y$w_buff0~0_379) .cse8)) (= |v_ULTIMATE.start_main_#t~ite83_160| v_~y$w_buff0~0_378)))))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_953, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_121|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_115|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_155|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_159|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_151|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_165|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_169|, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_159|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_171|, ~y$w_buff0~0=v_~y$w_buff0~0_379, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_81, ~y~0=v_~y~0_506, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_179|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_183|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_161|, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_159|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_165|, ~y$w_buff1~0=v_~y$w_buff1~0_367, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_159|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_341, ~x~0=v_~x~0_78, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_288, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_779} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_952, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_120|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_114|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_70, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_154|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_158|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_68|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_150|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_78|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_164|, ~y$mem_tmp~0=v_~y$mem_tmp~0_138, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_168|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_33, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_72|, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_158|, ULTIMATE.start_main_#t~ite100=|v_ULTIMATE.start_main_#t~ite100_72|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_170|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_78|, ~y$w_buff0~0=v_~y$w_buff0~0_378, ~y$flush_delayed~0=v_~y$flush_delayed~0_194, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_81, ~y~0=v_~y~0_505, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_25|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite99=|v_ULTIMATE.start_main_#t~ite99_76|, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_178|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_182|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_160|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_70|, ~weak$$choice0~0=v_~weak$$choice0~0_105, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_158|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_164|, ~y$w_buff1~0=v_~y$w_buff1~0_366, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_70|, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_158|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_340, ~weak$$choice2~0=v_~weak$$choice2~0_310, ~x~0=v_~x~0_78, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_287, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_778} AuxVars[|v_ULTIMATE.start_main_#t~ite94_170|, v_~y~0_507, |v_ULTIMATE.start_main_#t~ite88_160|, |v_ULTIMATE.start_main_#t~ite86_152|, |v_ULTIMATE.start_main_#t~ite89_156|, |v_ULTIMATE.start_main_#t~ite97_184|, |v_ULTIMATE.start_main_#t~ite95_166|, |v_ULTIMATE.start_main_#t~ite92_160|, |v_ULTIMATE.start_main_#t~ite82_166|, |v_ULTIMATE.start_main_#t~ite85_162|, |v_ULTIMATE.start_main_#t~ite83_160|, |v_ULTIMATE.start_main_#t~ite80_160|, |v_ULTIMATE.start_main_#t~ite91_172|, |v_ULTIMATE.start_main_#t~ite98_180|] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet79, ULTIMATE.start_main_#t~nondet78, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite96, ULTIMATE.start_main_#t~ite95, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite94, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~ite100, ULTIMATE.start_main_#t~ite91, ULTIMATE.start_main_#t~ite90, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite99, ULTIMATE.start_main_#t~ite98, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#t~ite80, ~y$r_buff0_thd0~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][58], [Black: 192#(and (= ~y$r_buff1_thd0~0 0) (or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~y~0 ~__unbuffered_p2_EBX~0)) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 321#(and (or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y~0 ~__unbuffered_p2_EBX~0) (not (= 2 ~y~0))) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 9#P1EXITtrue, Black: 137#(<= ~x~0 0), 273#true, Black: 205#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd3~0 0)), Black: 207#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0)), 83#L761true, 342#true, Black: 275#(and (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 276#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 153#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0)), Black: 280#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 221#(= ~x~0 1), Black: 352#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$w_buff0_used~0 0) (or (= ~y~0 ~y$w_buff0~0) (= ~y~0 ~__unbuffered_p2_EBX~0)) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0)), 99#L827true, Black: 344#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0)), Black: 348#(and (= ~y$r_buff1_thd0~0 0) (or (= ~y~0 0) (= ~y~0 ~__unbuffered_p2_EBX~0)) (= ~y$r_buff0_thd0~0 0)), 167#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 169#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0)), 49#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 238#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 314#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 188#(and (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff0_thd0~0 0)), 380#true, Black: 122#(= ~__unbuffered_p2_EBX~0 0)]) [2021-03-26 00:36:11,150 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-03-26 00:36:11,150 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-26 00:36:11,150 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-26 00:36:11,150 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-26 00:36:11,153 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L827-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][49], [Black: 192#(and (= ~y$r_buff1_thd0~0 0) (or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~y~0 ~__unbuffered_p2_EBX~0)) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 321#(and (or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y~0 ~__unbuffered_p2_EBX~0) (not (= 2 ~y~0))) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 9#P1EXITtrue, Black: 137#(<= ~x~0 0), 273#true, Black: 205#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd3~0 0)), Black: 207#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0)), 342#true, Black: 275#(and (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 276#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 27#L860true, Black: 153#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0)), Black: 280#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 221#(= ~x~0 1), Black: 352#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$w_buff0_used~0 0) (or (= ~y~0 ~y$w_buff0~0) (= ~y~0 ~__unbuffered_p2_EBX~0)) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0)), Black: 344#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0)), Black: 348#(and (= ~y$r_buff1_thd0~0 0) (or (= ~y~0 0) (= ~y~0 ~__unbuffered_p2_EBX~0)) (= ~y$r_buff0_thd0~0 0)), 167#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 169#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0)), 48#P2EXITtrue, Black: 238#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 54#P0EXITtrue, 314#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 380#true, 188#(and (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 122#(= ~__unbuffered_p2_EBX~0 0)]) [2021-03-26 00:36:11,153 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-26 00:36:11,153 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 00:36:11,153 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 00:36:11,153 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 00:36:11,154 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L827-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][49], [Black: 192#(and (= ~y$r_buff1_thd0~0 0) (or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~y~0 ~__unbuffered_p2_EBX~0)) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 321#(and (or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y~0 ~__unbuffered_p2_EBX~0) (not (= 2 ~y~0))) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 9#P1EXITtrue, Black: 137#(<= ~x~0 0), 273#true, Black: 205#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd3~0 0)), Black: 207#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0)), 342#true, Black: 275#(and (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 276#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 27#L860true, Black: 153#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0)), Black: 280#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 221#(= ~x~0 1), Black: 352#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$w_buff0_used~0 0) (or (= ~y~0 ~y$w_buff0~0) (= ~y~0 ~__unbuffered_p2_EBX~0)) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0)), Black: 344#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0)), Black: 348#(and (= ~y$r_buff1_thd0~0 0) (or (= ~y~0 0) (= ~y~0 ~__unbuffered_p2_EBX~0)) (= ~y$r_buff0_thd0~0 0)), 167#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 169#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0)), 48#P2EXITtrue, Black: 238#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 54#P0EXITtrue, 314#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 188#(and (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff0_thd0~0 0)), 380#true, Black: 122#(= ~__unbuffered_p2_EBX~0 0)]) [2021-03-26 00:36:11,154 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-26 00:36:11,154 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 00:36:11,154 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 00:36:11,154 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 00:36:11,155 INFO L129 PetriNetUnfolder]: 431/958 cut-off events. [2021-03-26 00:36:11,155 INFO L130 PetriNetUnfolder]: For 3587/3721 co-relation queries the response was YES. [2021-03-26 00:36:11,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3161 conditions, 958 events. 431/958 cut-off events. For 3587/3721 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 6959 event pairs, 118 based on Foata normal form. 156/1054 useless extension candidates. Maximal degree in co-relation 3127. Up to 560 conditions per place. [2021-03-26 00:36:11,162 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 8 selfloop transitions, 8 changer transitions 0/59 dead transitions. [2021-03-26 00:36:11,162 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 59 transitions, 569 flow [2021-03-26 00:36:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:36:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:36:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 753 transitions. [2021-03-26 00:36:11,166 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8605714285714285 [2021-03-26 00:36:11,166 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 753 transitions. [2021-03-26 00:36:11,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 753 transitions. [2021-03-26 00:36:11,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:11,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 753 transitions. [2021-03-26 00:36:11,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.6) internal successors, (753), 5 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:11,169 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 00:36:11,169 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 00:36:11,170 INFO L185 Difference]: Start difference. First operand has 70 places, 56 transitions, 640 flow. Second operand 5 states and 753 transitions. [2021-03-26 00:36:11,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 59 transitions, 569 flow [2021-03-26 00:36:11,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 59 transitions, 545 flow, removed 4 selfloop flow, removed 5 redundant places. [2021-03-26 00:36:11,178 INFO L241 Difference]: Finished difference. Result has 72 places, 56 transitions, 553 flow [2021-03-26 00:36:11,178 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=553, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2021-03-26 00:36:11,179 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 24 predicate places. [2021-03-26 00:36:11,179 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:11,179 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 56 transitions, 553 flow [2021-03-26 00:36:11,179 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 56 transitions, 553 flow [2021-03-26 00:36:11,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 56 transitions, 553 flow [2021-03-26 00:36:11,289 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1669] L860-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse19 (= (mod v_~y$w_buff1_used~0_779 256) 0)) (.cse17 (= (mod v_~y$r_buff1_thd0~0_288 256) 0)) (.cse14 (= (mod v_~y$r_buff0_thd0~0_341 256) 0))) (let ((.cse15 (not .cse14)) (.cse4 (and .cse14 .cse17)) (.cse18 (= (mod v_~y$w_buff0_used~0_953 256) 0)) (.cse5 (and .cse14 .cse19)) (.cse0 (= (mod v_~weak$$choice2~0_310 256) 0))) (let ((.cse2 (not .cse0)) (.cse10 (or .cse4 .cse18 .cse5)) (.cse7 (or .cse15 (not .cse19))) (.cse11 (not .cse18)) (.cse8 (or .cse15 (not .cse17)))) (and (= (mod v_~main$tmp_guard1~0_70 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_25|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_33 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_25|) (= v_~weak$$choice2~0_310 |v_ULTIMATE.start_main_#t~nondet79_121|) (let ((.cse1 (= |v_ULTIMATE.start_main_#t~ite97_184| |v_ULTIMATE.start_main_#t~ite97_183|))) (or (and .cse0 (= v_~y$r_buff1_thd0~0_287 |v_ULTIMATE.start_main_#t~ite98_180|) .cse1 (= v_~y$r_buff1_thd0~0_288 |v_ULTIMATE.start_main_#t~ite98_180|)) (and (= |v_ULTIMATE.start_main_#t~ite98_180| |v_ULTIMATE.start_main_#t~ite98_179|) (= v_~y$r_buff1_thd0~0_288 v_~y$r_buff1_thd0~0_287) .cse1 .cse2))) (or (and .cse0 (= v_~y~0_507 v_~y~0_505)) (and (= v_~y~0_505 v_~y$mem_tmp~0_138) .cse2)) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~ite91_172| |v_ULTIMATE.start_main_#t~ite91_171|))) (or (and .cse0 (let ((.cse3 (= (mod v_~y$w_buff0_used~0_952 256) 0))) (or (and (or .cse3 .cse4 .cse5) (= v_~y$w_buff1_used~0_779 |v_ULTIMATE.start_main_#t~ite92_160|) .cse6) (and .cse7 (not .cse3) .cse8 (= |v_ULTIMATE.start_main_#t~ite91_172| |v_ULTIMATE.start_main_#t~ite92_160|) (= |v_ULTIMATE.start_main_#t~ite91_172| 0)))) (= v_~y$w_buff1_used~0_778 |v_ULTIMATE.start_main_#t~ite92_160|)) (and (= v_~y$w_buff1_used~0_779 v_~y$w_buff1_used~0_778) (= |v_ULTIMATE.start_main_#t~ite92_160| |v_ULTIMATE.start_main_#t~ite92_159|) .cse2 .cse6))) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite85_162| |v_ULTIMATE.start_main_#t~ite85_161|))) (or (and .cse9 (= |v_ULTIMATE.start_main_#t~ite86_152| |v_ULTIMATE.start_main_#t~ite86_151|) (= v_~y$w_buff1~0_367 v_~y$w_buff1~0_366) .cse2) (and .cse0 (or (and .cse9 .cse10 (= v_~y$w_buff1~0_367 |v_ULTIMATE.start_main_#t~ite86_152|)) (and (= v_~y$w_buff1~0_367 |v_ULTIMATE.start_main_#t~ite85_162|) (= |v_ULTIMATE.start_main_#t~ite85_162| |v_ULTIMATE.start_main_#t~ite86_152|) .cse7 .cse11 .cse8)) (= v_~y$w_buff1~0_366 |v_ULTIMATE.start_main_#t~ite86_152|)))) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite94_169| |v_ULTIMATE.start_main_#t~ite94_170|))) (or (and (= v_~y$r_buff0_thd0~0_341 v_~y$r_buff0_thd0~0_340) (= |v_ULTIMATE.start_main_#t~ite95_165| |v_ULTIMATE.start_main_#t~ite95_166|) .cse12 .cse2) (and .cse0 (= v_~y$r_buff0_thd0~0_341 |v_ULTIMATE.start_main_#t~ite95_166|) (= v_~y$r_buff0_thd0~0_340 |v_ULTIMATE.start_main_#t~ite95_166|) .cse12))) (= v_~weak$$choice0~0_105 |v_ULTIMATE.start_main_#t~nondet78_115|) (= (ite (= (ite (not (and (= v_~y~0_507 2) (= v_~__unbuffered_p2_EBX~0_80 1) (= v_~__unbuffered_p2_EAX~0_81 1) (= v_~x~0_78 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_70) (= v_~y$flush_delayed~0_194 0) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite88_159| |v_ULTIMATE.start_main_#t~ite88_160|))) (or (and .cse13 (= v_~y$w_buff0_used~0_953 v_~y$w_buff0_used~0_952) (= |v_ULTIMATE.start_main_#t~ite89_156| |v_ULTIMATE.start_main_#t~ite89_155|) .cse2) (and .cse0 (= v_~y$w_buff0_used~0_952 |v_ULTIMATE.start_main_#t~ite89_156|) (or (and (= |v_ULTIMATE.start_main_#t~ite88_160| |v_ULTIMATE.start_main_#t~ite89_156|) .cse7 .cse11 .cse8 (or (and .cse14 (= v_~y$w_buff0_used~0_953 |v_ULTIMATE.start_main_#t~ite88_160|)) (and (= |v_ULTIMATE.start_main_#t~ite88_160| 0) .cse15))) (and .cse10 .cse13 (= v_~y$w_buff0_used~0_953 |v_ULTIMATE.start_main_#t~ite89_156|)))))) (= v_~y~0_506 v_~y$mem_tmp~0_138) (or (and (= v_~y~0_507 |v_ULTIMATE.start_main_#t~ite80_160|) .cse7 (or (and .cse14 (= v_~y$w_buff1~0_367 |v_ULTIMATE.start_main_#t~ite80_160|)) (and .cse15 (= |v_ULTIMATE.start_main_#t~ite80_160| v_~y$w_buff0~0_379))) .cse11 .cse8) (and (= v_~y~0_507 v_~y~0_506) .cse10 (= |v_ULTIMATE.start_main_#t~ite80_159| |v_ULTIMATE.start_main_#t~ite80_160|))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_33 0) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite82_166| |v_ULTIMATE.start_main_#t~ite82_165|))) (or (and .cse16 (= v_~y$w_buff0~0_379 v_~y$w_buff0~0_378) (= |v_ULTIMATE.start_main_#t~ite83_159| |v_ULTIMATE.start_main_#t~ite83_160|) .cse2) (and .cse0 (or (and .cse16 .cse10 (= |v_ULTIMATE.start_main_#t~ite83_160| v_~y$w_buff0~0_379)) (and (= |v_ULTIMATE.start_main_#t~ite82_166| |v_ULTIMATE.start_main_#t~ite83_160|) .cse7 .cse11 (= |v_ULTIMATE.start_main_#t~ite82_166| v_~y$w_buff0~0_379) .cse8)) (= |v_ULTIMATE.start_main_#t~ite83_160| v_~y$w_buff0~0_378)))))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_953, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_121|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_115|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_155|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_159|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_151|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_165|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_169|, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_159|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_171|, ~y$w_buff0~0=v_~y$w_buff0~0_379, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_81, ~y~0=v_~y~0_506, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_179|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_183|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_161|, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_159|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_165|, ~y$w_buff1~0=v_~y$w_buff1~0_367, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_159|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_341, ~x~0=v_~x~0_78, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_288, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_779} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_952, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_120|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_114|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_70, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_154|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_158|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_68|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_150|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_78|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_164|, ~y$mem_tmp~0=v_~y$mem_tmp~0_138, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_168|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_33, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_72|, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_158|, ULTIMATE.start_main_#t~ite100=|v_ULTIMATE.start_main_#t~ite100_72|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_170|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_78|, ~y$w_buff0~0=v_~y$w_buff0~0_378, ~y$flush_delayed~0=v_~y$flush_delayed~0_194, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_81, ~y~0=v_~y~0_505, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_25|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite99=|v_ULTIMATE.start_main_#t~ite99_76|, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_178|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_182|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_160|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_70|, ~weak$$choice0~0=v_~weak$$choice0~0_105, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_158|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_164|, ~y$w_buff1~0=v_~y$w_buff1~0_366, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_70|, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_158|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_340, ~weak$$choice2~0=v_~weak$$choice2~0_310, ~x~0=v_~x~0_78, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_287, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_778} AuxVars[|v_ULTIMATE.start_main_#t~ite94_170|, v_~y~0_507, |v_ULTIMATE.start_main_#t~ite88_160|, |v_ULTIMATE.start_main_#t~ite86_152|, |v_ULTIMATE.start_main_#t~ite89_156|, |v_ULTIMATE.start_main_#t~ite97_184|, |v_ULTIMATE.start_main_#t~ite95_166|, |v_ULTIMATE.start_main_#t~ite92_160|, |v_ULTIMATE.start_main_#t~ite82_166|, |v_ULTIMATE.start_main_#t~ite85_162|, |v_ULTIMATE.start_main_#t~ite83_160|, |v_ULTIMATE.start_main_#t~ite80_160|, |v_ULTIMATE.start_main_#t~ite91_172|, |v_ULTIMATE.start_main_#t~ite98_180|] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet79, ULTIMATE.start_main_#t~nondet78, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite96, ULTIMATE.start_main_#t~ite95, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite94, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~ite100, ULTIMATE.start_main_#t~ite91, ULTIMATE.start_main_#t~ite90, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite99, ULTIMATE.start_main_#t~ite98, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#t~ite80, ~y$r_buff0_thd0~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][17], [Black: 192#(and (= ~y$r_buff1_thd0~0 0) (or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~y~0 ~__unbuffered_p2_EBX~0)) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 385#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~__unbuffered_cnt~0 0)), Black: 382#(= ~__unbuffered_cnt~0 0), Black: 321#(and (or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y~0 ~__unbuffered_p2_EBX~0) (not (= 2 ~y~0))) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 383#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), 11#L781true, Black: 137#(<= ~x~0 0), 273#true, 342#true, Black: 275#(and (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 276#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 153#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0)), Black: 280#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), Black: 221#(= ~x~0 1), Black: 352#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$w_buff0_used~0 0) (or (= ~y~0 ~y$w_buff0~0) (= ~y~0 ~__unbuffered_p2_EBX~0)) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0)), 99#L827true, Black: 344#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0)), Black: 348#(and (= ~y$r_buff1_thd0~0 0) (or (= ~y~0 0) (= ~y~0 ~__unbuffered_p2_EBX~0)) (= ~y$r_buff0_thd0~0 0)), 167#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 49#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 238#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 54#P0EXITtrue, 314#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 188#(and (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff0_thd0~0 0)), 380#true, Black: 122#(= ~__unbuffered_p2_EBX~0 0)]) [2021-03-26 00:36:11,289 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 00:36:11,289 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 00:36:11,289 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 00:36:11,289 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 00:36:11,303 INFO L129 PetriNetUnfolder]: 429/958 cut-off events. [2021-03-26 00:36:11,304 INFO L130 PetriNetUnfolder]: For 4142/4380 co-relation queries the response was YES. [2021-03-26 00:36:11,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3744 conditions, 958 events. 429/958 cut-off events. For 4142/4380 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 7147 event pairs, 128 based on Foata normal form. 47/933 useless extension candidates. Maximal degree in co-relation 3711. Up to 570 conditions per place. [2021-03-26 00:36:11,314 INFO L142 LiptonReduction]: Number of co-enabled transitions 552 [2021-03-26 00:36:11,336 INFO L154 LiptonReduction]: Checked pairs total: 37 [2021-03-26 00:36:11,336 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:36:11,336 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 157 [2021-03-26 00:36:11,337 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 55 transitions, 547 flow [2021-03-26 00:36:11,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:11,337 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:11,337 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:11,337 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:36:11,337 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 00:36:11,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:11,338 INFO L82 PathProgramCache]: Analyzing trace with hash 148332160, now seen corresponding path program 1 times [2021-03-26 00:36:11,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:11,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732884804] [2021-03-26 00:36:11,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:11,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:11,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:36:11,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:11,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:36:11,475 INFO L142 QuantifierPusher]: treesize reduction 8, result has 72.4 percent of original size [2021-03-26 00:36:11,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:36:11,501 INFO L142 QuantifierPusher]: treesize reduction 18, result has 76.9 percent of original size [2021-03-26 00:36:11,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-03-26 00:36:11,564 INFO L142 QuantifierPusher]: treesize reduction 18, result has 78.6 percent of original size [2021-03-26 00:36:11,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-03-26 00:36:11,638 INFO L142 QuantifierPusher]: treesize reduction 18, result has 76.9 percent of original size [2021-03-26 00:36:11,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-03-26 00:36:11,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:11,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 00:36:11,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:11,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 00:36:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:11,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732884804] [2021-03-26 00:36:11,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:11,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 00:36:11,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838496650] [2021-03-26 00:36:11,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 00:36:11,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:11,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 00:36:11,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-26 00:36:11,722 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 175 [2021-03-26 00:36:11,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 55 transitions, 547 flow. Second operand has 9 states, 9 states have (on average 113.0) internal successors, (1017), 9 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:11,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:11,723 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 175 [2021-03-26 00:36:11,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:12,245 INFO L129 PetriNetUnfolder]: 445/950 cut-off events. [2021-03-26 00:36:12,246 INFO L130 PetriNetUnfolder]: For 4864/4926 co-relation queries the response was YES. [2021-03-26 00:36:12,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4406 conditions, 950 events. 445/950 cut-off events. For 4864/4926 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 6626 event pairs, 168 based on Foata normal form. 15/899 useless extension candidates. Maximal degree in co-relation 4371. Up to 451 conditions per place. [2021-03-26 00:36:12,253 INFO L132 encePairwiseOnDemand]: 167/175 looper letters, 26 selfloop transitions, 13 changer transitions 10/65 dead transitions. [2021-03-26 00:36:12,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 65 transitions, 752 flow [2021-03-26 00:36:12,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:36:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:36:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 929 transitions. [2021-03-26 00:36:12,258 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6635714285714286 [2021-03-26 00:36:12,258 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 929 transitions. [2021-03-26 00:36:12,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 929 transitions. [2021-03-26 00:36:12,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:12,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 929 transitions. [2021-03-26 00:36:12,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:12,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 175.0) internal successors, (1575), 9 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:12,263 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 175.0) internal successors, (1575), 9 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:12,263 INFO L185 Difference]: Start difference. First operand has 72 places, 55 transitions, 547 flow. Second operand 8 states and 929 transitions. [2021-03-26 00:36:12,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 65 transitions, 752 flow [2021-03-26 00:36:12,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 65 transitions, 736 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-03-26 00:36:12,277 INFO L241 Difference]: Finished difference. Result has 77 places, 51 transitions, 562 flow [2021-03-26 00:36:12,277 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=562, PETRI_PLACES=77, PETRI_TRANSITIONS=51} [2021-03-26 00:36:12,277 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 29 predicate places. [2021-03-26 00:36:12,277 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:12,277 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 51 transitions, 562 flow [2021-03-26 00:36:12,278 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 51 transitions, 562 flow [2021-03-26 00:36:12,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 51 transitions, 562 flow [2021-03-26 00:36:12,364 INFO L129 PetriNetUnfolder]: 369/799 cut-off events. [2021-03-26 00:36:12,364 INFO L130 PetriNetUnfolder]: For 5322/5469 co-relation queries the response was YES. [2021-03-26 00:36:12,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3282 conditions, 799 events. 369/799 cut-off events. For 5322/5469 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 5411 event pairs, 121 based on Foata normal form. 13/758 useless extension candidates. Maximal degree in co-relation 3247. Up to 454 conditions per place. [2021-03-26 00:36:12,373 INFO L142 LiptonReduction]: Number of co-enabled transitions 374 [2021-03-26 00:36:12,382 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:36:12,383 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:36:12,383 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 106 [2021-03-26 00:36:12,383 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 51 transitions, 562 flow [2021-03-26 00:36:12,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 113.0) internal successors, (1017), 9 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:12,384 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:12,384 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:12,384 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:36:12,384 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 00:36:12,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:12,385 INFO L82 PathProgramCache]: Analyzing trace with hash 906909290, now seen corresponding path program 1 times [2021-03-26 00:36:12,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:12,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100714448] [2021-03-26 00:36:12,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:12,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:12,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:36:12,460 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-26 00:36:12,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:36:12,468 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:36:12,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:36:12,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:12,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:36:12,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:12,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100714448] [2021-03-26 00:36:12,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:12,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:36:12,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213306632] [2021-03-26 00:36:12,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:36:12,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:12,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:36:12,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:36:12,491 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 175 [2021-03-26 00:36:12,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 51 transitions, 562 flow. Second operand has 5 states, 5 states have (on average 147.8) internal successors, (739), 5 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:12,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:12,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 175 [2021-03-26 00:36:12,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:12,615 INFO L129 PetriNetUnfolder]: 210/574 cut-off events. [2021-03-26 00:36:12,616 INFO L130 PetriNetUnfolder]: For 2627/2887 co-relation queries the response was YES. [2021-03-26 00:36:12,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2581 conditions, 574 events. 210/574 cut-off events. For 2627/2887 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3930 event pairs, 15 based on Foata normal form. 202/768 useless extension candidates. Maximal degree in co-relation 2544. Up to 380 conditions per place. [2021-03-26 00:36:12,621 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 5 selfloop transitions, 10 changer transitions 4/61 dead transitions. [2021-03-26 00:36:12,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 61 transitions, 658 flow [2021-03-26 00:36:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:36:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:36:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 903 transitions. [2021-03-26 00:36:12,624 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.86 [2021-03-26 00:36:12,625 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 903 transitions. [2021-03-26 00:36:12,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 903 transitions. [2021-03-26 00:36:12,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:12,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 903 transitions. [2021-03-26 00:36:12,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:12,629 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 00:36:12,629 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 00:36:12,629 INFO L185 Difference]: Start difference. First operand has 77 places, 51 transitions, 562 flow. Second operand 6 states and 903 transitions. [2021-03-26 00:36:12,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 61 transitions, 658 flow [2021-03-26 00:36:12,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 61 transitions, 592 flow, removed 9 selfloop flow, removed 11 redundant places. [2021-03-26 00:36:12,637 INFO L241 Difference]: Finished difference. Result has 74 places, 57 transitions, 576 flow [2021-03-26 00:36:12,637 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2021-03-26 00:36:12,637 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 26 predicate places. [2021-03-26 00:36:12,637 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:12,637 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 57 transitions, 576 flow [2021-03-26 00:36:12,637 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 57 transitions, 576 flow [2021-03-26 00:36:12,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 57 transitions, 576 flow [2021-03-26 00:36:12,694 INFO L129 PetriNetUnfolder]: 169/539 cut-off events. [2021-03-26 00:36:12,694 INFO L130 PetriNetUnfolder]: For 2475/2626 co-relation queries the response was YES. [2021-03-26 00:36:12,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2583 conditions, 539 events. 169/539 cut-off events. For 2475/2626 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4099 event pairs, 16 based on Foata normal form. 12/543 useless extension candidates. Maximal degree in co-relation 2549. Up to 342 conditions per place. [2021-03-26 00:36:12,700 INFO L142 LiptonReduction]: Number of co-enabled transitions 422 [2021-03-26 00:36:12,728 INFO L154 LiptonReduction]: Checked pairs total: 29 [2021-03-26 00:36:12,728 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:36:12,728 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 91 [2021-03-26 00:36:12,729 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 568 flow [2021-03-26 00:36:12,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 147.8) internal successors, (739), 5 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:12,729 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:12,729 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:12,729 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 00:36:12,729 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 00:36:12,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:12,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1367334994, now seen corresponding path program 1 times [2021-03-26 00:36:12,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:12,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178789497] [2021-03-26 00:36:12,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:12,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:12,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:36:12,831 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-26 00:36:12,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 00:36:12,862 INFO L142 QuantifierPusher]: treesize reduction 26, result has 61.8 percent of original size [2021-03-26 00:36:12,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 00:36:12,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:12,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:36:12,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:12,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178789497] [2021-03-26 00:36:12,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:12,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:36:12,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543207301] [2021-03-26 00:36:12,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:36:12,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:12,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:36:12,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:36:12,939 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 175 [2021-03-26 00:36:12,939 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 56 transitions, 568 flow. Second operand has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:12,939 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:12,939 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 175 [2021-03-26 00:36:12,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:13,231 INFO L129 PetriNetUnfolder]: 198/567 cut-off events. [2021-03-26 00:36:13,231 INFO L130 PetriNetUnfolder]: For 3156/3236 co-relation queries the response was YES. [2021-03-26 00:36:13,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 567 events. 198/567 cut-off events. For 3156/3236 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3841 event pairs, 40 based on Foata normal form. 18/565 useless extension candidates. Maximal degree in co-relation 2931. Up to 289 conditions per place. [2021-03-26 00:36:13,235 INFO L132 encePairwiseOnDemand]: 168/175 looper letters, 23 selfloop transitions, 10 changer transitions 9/61 dead transitions. [2021-03-26 00:36:13,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 61 transitions, 702 flow [2021-03-26 00:36:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:36:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:36:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 768 transitions. [2021-03-26 00:36:13,239 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7314285714285714 [2021-03-26 00:36:13,239 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 768 transitions. [2021-03-26 00:36:13,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 768 transitions. [2021-03-26 00:36:13,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:13,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 768 transitions. [2021-03-26 00:36:13,241 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 00:36:13,243 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 00:36:13,243 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 00:36:13,243 INFO L185 Difference]: Start difference. First operand has 74 places, 56 transitions, 568 flow. Second operand 6 states and 768 transitions. [2021-03-26 00:36:13,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 61 transitions, 702 flow [2021-03-26 00:36:13,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 61 transitions, 676 flow, removed 11 selfloop flow, removed 3 redundant places. [2021-03-26 00:36:13,252 INFO L241 Difference]: Finished difference. Result has 76 places, 51 transitions, 528 flow [2021-03-26 00:36:13,252 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=528, PETRI_PLACES=76, PETRI_TRANSITIONS=51} [2021-03-26 00:36:13,252 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2021-03-26 00:36:13,252 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:13,252 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 51 transitions, 528 flow [2021-03-26 00:36:13,253 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 51 transitions, 528 flow [2021-03-26 00:36:13,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 51 transitions, 528 flow [2021-03-26 00:36:13,295 INFO L129 PetriNetUnfolder]: 124/366 cut-off events. [2021-03-26 00:36:13,295 INFO L130 PetriNetUnfolder]: For 1697/1719 co-relation queries the response was YES. [2021-03-26 00:36:13,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 366 events. 124/366 cut-off events. For 1697/1719 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2242 event pairs, 18 based on Foata normal form. 8/367 useless extension candidates. Maximal degree in co-relation 1589. Up to 131 conditions per place. [2021-03-26 00:36:13,299 INFO L142 LiptonReduction]: Number of co-enabled transitions 284 [2021-03-26 00:36:13,305 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:36:13,305 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:36:13,305 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-03-26 00:36:13,305 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 51 transitions, 528 flow [2021-03-26 00:36:13,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:13,306 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:13,306 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 00:36:13,306 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 00:36:13,306 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 00:36:13,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:13,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1372684272, now seen corresponding path program 1 times [2021-03-26 00:36:13,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:13,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29915935] [2021-03-26 00:36:13,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:13,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:13,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:36:13,417 INFO L142 QuantifierPusher]: treesize reduction 10, result has 85.5 percent of original size [2021-03-26 00:36:13,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-03-26 00:36:13,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:13,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 00:36:13,493 INFO L142 QuantifierPusher]: treesize reduction 30, result has 66.3 percent of original size [2021-03-26 00:36:13,496 INFO L147 QuantifierPusher]: treesize reduction 9, result has 84.7 percent of original size 50 [2021-03-26 00:36:13,573 INFO L142 QuantifierPusher]: treesize reduction 30, result has 63.9 percent of original size [2021-03-26 00:36:13,576 INFO L147 QuantifierPusher]: treesize reduction 9, result has 83.0 percent of original size 44 [2021-03-26 00:36:13,645 INFO L142 QuantifierPusher]: treesize reduction 11, result has 56.0 percent of original size [2021-03-26 00:36:13,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:36:13,672 INFO L142 QuantifierPusher]: treesize reduction 11, result has 56.0 percent of original size [2021-03-26 00:36:13,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:36:13,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:13,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29915935] [2021-03-26 00:36:13,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:13,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:36:13,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14200206] [2021-03-26 00:36:13,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:36:13,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:13,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:36:13,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:36:13,676 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 175 [2021-03-26 00:36:13,677 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 51 transitions, 528 flow. Second operand has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:13,677 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:13,677 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 175 [2021-03-26 00:36:13,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:14,036 INFO L129 PetriNetUnfolder]: 145/411 cut-off events. [2021-03-26 00:36:14,037 INFO L130 PetriNetUnfolder]: For 2315/2328 co-relation queries the response was YES. [2021-03-26 00:36:14,038 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2007 conditions, 411 events. 145/411 cut-off events. For 2315/2328 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2489 event pairs, 31 based on Foata normal form. 11/408 useless extension candidates. Maximal degree in co-relation 1970. Up to 140 conditions per place. [2021-03-26 00:36:14,039 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 9 selfloop transitions, 9 changer transitions 21/56 dead transitions. [2021-03-26 00:36:14,039 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 56 transitions, 654 flow [2021-03-26 00:36:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:36:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:36:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 700 transitions. [2021-03-26 00:36:14,043 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2021-03-26 00:36:14,043 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 700 transitions. [2021-03-26 00:36:14,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 700 transitions. [2021-03-26 00:36:14,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:14,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 700 transitions. [2021-03-26 00:36:14,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:14,046 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 00:36:14,046 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 00:36:14,046 INFO L185 Difference]: Start difference. First operand has 76 places, 51 transitions, 528 flow. Second operand 6 states and 700 transitions. [2021-03-26 00:36:14,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 56 transitions, 654 flow [2021-03-26 00:36:14,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 56 transitions, 617 flow, removed 5 selfloop flow, removed 6 redundant places. [2021-03-26 00:36:14,052 INFO L241 Difference]: Finished difference. Result has 76 places, 33 transitions, 319 flow [2021-03-26 00:36:14,052 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=76, PETRI_TRANSITIONS=33} [2021-03-26 00:36:14,052 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2021-03-26 00:36:14,053 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:14,053 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 33 transitions, 319 flow [2021-03-26 00:36:14,053 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 33 transitions, 319 flow [2021-03-26 00:36:14,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 33 transitions, 319 flow [2021-03-26 00:36:14,065 INFO L129 PetriNetUnfolder]: 25/84 cut-off events. [2021-03-26 00:36:14,065 INFO L130 PetriNetUnfolder]: For 566/570 co-relation queries the response was YES. [2021-03-26 00:36:14,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 84 events. 25/84 cut-off events. For 566/570 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 247 event pairs, 6 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 387. Up to 27 conditions per place. [2021-03-26 00:36:14,066 INFO L142 LiptonReduction]: Number of co-enabled transitions 100 [2021-03-26 00:36:14,281 INFO L154 LiptonReduction]: Checked pairs total: 6 [2021-03-26 00:36:14,281 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:36:14,281 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 228 [2021-03-26 00:36:14,285 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 31 transitions, 315 flow [2021-03-26 00:36:14,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:14,286 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:14,286 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:14,286 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-26 00:36:14,286 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 00:36:14,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:14,286 INFO L82 PathProgramCache]: Analyzing trace with hash -403791534, now seen corresponding path program 1 times [2021-03-26 00:36:14,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:14,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124965985] [2021-03-26 00:36:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:14,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:14,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:36:14,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:14,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:36:14,369 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-26 00:36:14,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:36:14,379 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:36:14,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:36:14,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:14,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:36:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:14,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124965985] [2021-03-26 00:36:14,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:14,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:36:14,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312096411] [2021-03-26 00:36:14,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:36:14,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:14,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:36:14,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:36:14,400 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 177 [2021-03-26 00:36:14,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 31 transitions, 315 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:14,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:14,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 177 [2021-03-26 00:36:14,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:14,469 INFO L129 PetriNetUnfolder]: 16/63 cut-off events. [2021-03-26 00:36:14,469 INFO L130 PetriNetUnfolder]: For 359/364 co-relation queries the response was YES. [2021-03-26 00:36:14,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 63 events. 16/63 cut-off events. For 359/364 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 178 event pairs, 2 based on Foata normal form. 11/74 useless extension candidates. Maximal degree in co-relation 309. Up to 23 conditions per place. [2021-03-26 00:36:14,470 INFO L132 encePairwiseOnDemand]: 171/177 looper letters, 2 selfloop transitions, 11 changer transitions 3/35 dead transitions. [2021-03-26 00:36:14,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 35 transitions, 377 flow [2021-03-26 00:36:14,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:36:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:36:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1061 transitions. [2021-03-26 00:36:14,474 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8563357546408394 [2021-03-26 00:36:14,474 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1061 transitions. [2021-03-26 00:36:14,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1061 transitions. [2021-03-26 00:36:14,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:14,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1061 transitions. [2021-03-26 00:36:14,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 151.57142857142858) internal successors, (1061), 7 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:14,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:14,477 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:14,477 INFO L185 Difference]: Start difference. First operand has 66 places, 31 transitions, 315 flow. Second operand 7 states and 1061 transitions. [2021-03-26 00:36:14,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 35 transitions, 377 flow [2021-03-26 00:36:14,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 35 transitions, 263 flow, removed 32 selfloop flow, removed 20 redundant places. [2021-03-26 00:36:14,480 INFO L241 Difference]: Finished difference. Result has 55 places, 32 transitions, 249 flow [2021-03-26 00:36:14,480 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=55, PETRI_TRANSITIONS=32} [2021-03-26 00:36:14,480 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2021-03-26 00:36:14,480 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:14,481 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 32 transitions, 249 flow [2021-03-26 00:36:14,481 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 32 transitions, 249 flow [2021-03-26 00:36:14,481 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 32 transitions, 249 flow [2021-03-26 00:36:14,489 INFO L129 PetriNetUnfolder]: 14/60 cut-off events. [2021-03-26 00:36:14,489 INFO L130 PetriNetUnfolder]: For 159/161 co-relation queries the response was YES. [2021-03-26 00:36:14,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 60 events. 14/60 cut-off events. For 159/161 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 173 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 242. Up to 21 conditions per place. [2021-03-26 00:36:14,489 INFO L142 LiptonReduction]: Number of co-enabled transitions 78 [2021-03-26 00:36:17,334 WARN L205 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 368 DAG size of output: 328 [2021-03-26 00:36:18,632 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 315 [2021-03-26 00:36:25,067 WARN L205 SmtUtils]: Spent 6.43 s on a formula simplification. DAG size of input: 531 DAG size of output: 487 [2021-03-26 00:36:28,240 WARN L205 SmtUtils]: Spent 3.17 s on a formula simplification that was a NOOP. DAG size: 473 [2021-03-26 00:36:29,590 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-26 00:36:30,081 WARN L205 SmtUtils]: Spent 488.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 00:36:32,903 WARN L205 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 339 DAG size of output: 260 [2021-03-26 00:36:33,928 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 242 [2021-03-26 00:36:34,522 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 00:36:35,133 WARN L205 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 00:36:36,358 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 00:36:37,569 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 00:36:37,572 INFO L154 LiptonReduction]: Checked pairs total: 5 [2021-03-26 00:36:37,573 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:36:37,573 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23093 [2021-03-26 00:36:37,573 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 239 flow [2021-03-26 00:36:37,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:37,574 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:37,574 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:37,574 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-26 00:36:37,574 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 00:36:37,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:37,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1108187698, now seen corresponding path program 1 times [2021-03-26 00:36:37,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:37,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372127963] [2021-03-26 00:36:37,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:36:37,622 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:36:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:36:37,709 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:36:37,749 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:36:37,750 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:36:37,750 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-26 00:36:37,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:36:37 BasicIcfg [2021-03-26 00:36:37,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:36:37,862 INFO L168 Benchmark]: Toolchain (without parser) took 80232.61 ms. Allocated memory was 255.9 MB in the beginning and 935.3 MB in the end (delta: 679.5 MB). Free memory was 236.3 MB in the beginning and 860.0 MB in the end (delta: -623.8 MB). Peak memory consumption was 574.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:36:37,862 INFO L168 Benchmark]: CDTParser took 0.60 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:36:37,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.01 ms. Allocated memory was 255.9 MB in the beginning and 379.6 MB in the end (delta: 123.7 MB). Free memory was 236.3 MB in the beginning and 335.8 MB in the end (delta: -99.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:36:37,864 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.19 ms. Allocated memory is still 379.6 MB. Free memory was 335.8 MB in the beginning and 332.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:36:37,864 INFO L168 Benchmark]: Boogie Preprocessor took 66.65 ms. Allocated memory is still 379.6 MB. Free memory was 332.5 MB in the beginning and 329.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:36:37,865 INFO L168 Benchmark]: RCFGBuilder took 3086.35 ms. Allocated memory was 379.6 MB in the beginning and 478.2 MB in the end (delta: 98.6 MB). Free memory was 329.7 MB in the beginning and 416.8 MB in the end (delta: -87.1 MB). Peak memory consumption was 140.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:36:37,868 INFO L168 Benchmark]: TraceAbstraction took 76327.52 ms. Allocated memory was 478.2 MB in the beginning and 935.3 MB in the end (delta: 457.2 MB). Free memory was 415.7 MB in the beginning and 860.0 MB in the end (delta: -444.3 MB). Peak memory consumption was 533.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:36:37,869 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.60 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 664.01 ms. Allocated memory was 255.9 MB in the beginning and 379.6 MB in the end (delta: 123.7 MB). Free memory was 236.3 MB in the beginning and 335.8 MB in the end (delta: -99.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 83.19 ms. Allocated memory is still 379.6 MB. Free memory was 335.8 MB in the beginning and 332.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 66.65 ms. Allocated memory is still 379.6 MB. Free memory was 332.5 MB in the beginning and 329.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 3086.35 ms. Allocated memory was 379.6 MB in the beginning and 478.2 MB in the end (delta: 98.6 MB). Free memory was 329.7 MB in the beginning and 416.8 MB in the end (delta: -87.1 MB). Peak memory consumption was 140.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 76327.52 ms. Allocated memory was 478.2 MB in the beginning and 935.3 MB in the end (delta: 457.2 MB). Free memory was 415.7 MB in the beginning and 860.0 MB in the end (delta: -444.3 MB). Peak memory consumption was 533.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9849.4ms, 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 1029, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 1000, negative conditional: 0, negative unconditional: 1000, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1325, positive: 240, positive conditional: 240, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 1040, unknown conditional: 1040, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 39, Positive conditional cache size: 39, Positive unconditional cache size: 0, Negative cache size: 16, Negative conditional cache size: 16, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4802.1ms, 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, positive: 91, positive conditional: 6, positive unconditional: 85, negative: 12, negative conditional: 1, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 103, positive: 91, positive conditional: 6, positive unconditional: 85, 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: 103, positive: 88, positive conditional: 0, positive unconditional: 88, 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: 184, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 177, negative conditional: 17, negative unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 235, positive: 82, positive conditional: 82, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 103, unknown conditional: 103, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 41, Positive conditional cache size: 41, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1058.0ms, 37 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 771 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 196, positive: 136, positive conditional: 136, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 6, positive unconditional: 2, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 6, positive unconditional: 2, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 62, negative conditional: 42, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 196, positive: 128, positive conditional: 128, positive unconditional: 0, negative: 58, negative conditional: 58, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 49, Positive conditional cache size: 49, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2ms, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 233 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 8, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 8, 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: 13, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 38, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 62, Positive conditional cache size: 62, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 209.1ms, 36 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 182 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 10, positive conditional: 7, positive unconditional: 3, negative: 6, negative conditional: 3, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 10, positive conditional: 7, positive unconditional: 3, negative: 6, negative conditional: 3, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 3, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 189, negative conditional: 108, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 72, Positive conditional cache size: 72, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 122.0ms, 44 PlacesBefore, 44 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 145 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 6, positive unconditional: 3, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 6, positive unconditional: 3, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 81, Positive conditional cache size: 81, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 109.2ms, 49 PlacesBefore, 49 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 97 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 3, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 3, positive unconditional: 4, 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: 23, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 88, Positive conditional cache size: 88, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 80.1ms, 54 PlacesBefore, 54 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 144 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, positive: 33, positive conditional: 33, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 95, Positive conditional cache size: 95, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20304.3ms, 56 PlacesBefore, 56 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 356 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 110, positive: 92, positive conditional: 92, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 10, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 10, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, positive: 81, positive conditional: 81, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 75, Positive conditional cache size: 75, Positive unconditional cache size: 0, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 81.7ms, 54 PlacesBefore, 54 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 170 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 58, positive conditional: 58, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 11, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 11, 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: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 89, Positive conditional cache size: 89, Positive unconditional cache size: 0, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 65.7ms, 58 PlacesBefore, 56 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 128 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 96, Positive conditional cache size: 96, Positive unconditional cache size: 0, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6941.8ms, 58 PlacesBefore, 57 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 344 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 110, positive: 95, positive conditional: 95, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 33, positive conditional: 25, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 33, positive conditional: 25, positive unconditional: 8, 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: 34, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 12, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 551, positive: 516, positive conditional: 512, positive unconditional: 4, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, positive: 62, positive conditional: 62, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 34, unknown conditional: 34, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 111, Positive conditional cache size: 111, Positive unconditional cache size: 0, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 338.5ms, 64 PlacesBefore, 64 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 232 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 76, positive conditional: 76, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 15, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 15, 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: 18, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 255, positive: 255, positive conditional: 255, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, positive: 58, positive conditional: 58, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 129, Positive conditional cache size: 129, Positive unconditional cache size: 0, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 74.6ms, 70 PlacesBefore, 70 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 330 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 153, positive: 139, positive conditional: 139, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, positive: 29, positive conditional: 23, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, positive: 29, positive conditional: 23, positive unconditional: 6, 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: 29, positive: 29, positive conditional: 0, positive unconditional: 29, 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: 153, positive: 110, positive conditional: 110, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 158, Positive conditional cache size: 158, Positive unconditional cache size: 0, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 156.9ms, 72 PlacesBefore, 72 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 37 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 37, 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: 37, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 123, Positive conditional cache size: 123, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 104.9ms, 77 PlacesBefore, 77 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 123, Positive conditional cache size: 123, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 90.4ms, 74 PlacesBefore, 74 PlacesAfterwards, 57 TransitionsBefore, 56 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 29 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, positive: 29, positive conditional: 29, 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: 29, positive: 29, positive conditional: 0, positive unconditional: 29, 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: 29, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 123, Positive conditional cache size: 123, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.0ms, 76 PlacesBefore, 76 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 123, Positive conditional cache size: 123, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 228.3ms, 76 PlacesBefore, 66 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 6 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 72, Positive conditional cache size: 72, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23091.8ms, 55 PlacesBefore, 51 PlacesAfterwards, 32 TransitionsBefore, 29 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 5 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [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 t1879; [L845] FCALL, FORK 0 pthread_create(&t1879, ((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 t1880; [L847] FCALL, FORK 0 pthread_create(&t1880, ((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 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L848] 0 pthread_t t1881; [L849] FCALL, FORK 0 pthread_create(&t1881, ((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] 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] 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] 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] 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] 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] 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=50, weak$$choice2=255, 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 [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 [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=53, 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: 2.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 76033.8ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4505.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9927.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 91 SDtfs, 57 SDslu, 44 SDs, 0 SdLazy, 664 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1274.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1869.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=640occurred in iteration=13, InterpolantAutomatonStates: 99, 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: 74.4ms SsaConstructionTime, 673.6ms SatisfiabilityAnalysisTime, 2511.5ms InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 2689 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...