/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/mix036_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:15:41,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:15:41,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:15:41,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:15:41,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:15:41,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:15:41,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:15:41,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:15:41,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:15:41,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:15:41,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:15:41,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:15:41,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:15:41,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:15:41,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:15:41,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:15:41,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:15:41,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:15:41,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:15:41,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:15:41,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:15:41,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:15:41,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:15:41,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:15:41,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:15:41,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:15:41,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:15:41,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:15:41,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:15:41,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:15:41,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:15:41,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:15:41,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:15:41,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:15:41,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:15:41,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:15:41,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:15:41,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:15:41,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:15:41,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:15:41,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:15:41,432 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:15:41,462 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:15:41,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:15:41,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:15:41,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:15:41,463 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:15:41,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:15:41,463 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:15:41,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:15:41,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:15:41,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:15:41,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:15:41,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:15:41,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:15:41,464 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:15:41,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:15:41,465 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:15:41,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:15:41,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:15:41,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:15:41,465 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:15:41,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:15:41,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:15:41,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:15:41,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:15:41,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:15:41,466 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:15:41,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:15:41,467 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:15:41,467 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:15:41,467 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:15:41,467 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:15:41,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:15:41,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:15:41,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:15:41,786 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:15:41,787 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:15:41,788 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.oepc.i [2021-03-26 00:15:41,849 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68afdc1fa/40f3ddc7f5f64e268d912c6d5ef6e20a/FLAG5799c471c [2021-03-26 00:15:42,380 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:15:42,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.oepc.i [2021-03-26 00:15:42,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68afdc1fa/40f3ddc7f5f64e268d912c6d5ef6e20a/FLAG5799c471c [2021-03-26 00:15:42,861 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68afdc1fa/40f3ddc7f5f64e268d912c6d5ef6e20a [2021-03-26 00:15:42,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:15:42,864 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:15:42,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:15:42,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:15:42,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:15:42,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:15:42" (1/1) ... [2021-03-26 00:15:42,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7670e551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:42, skipping insertion in model container [2021-03-26 00:15:42,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:15:42" (1/1) ... [2021-03-26 00:15:42,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:15:42,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:15:43,026 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/mix036_pso.oepc.i[949,962] [2021-03-26 00:15:43,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:15:43,271 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:15:43,282 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/mix036_pso.oepc.i[949,962] [2021-03-26 00:15:43,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:15:43,436 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:15:43,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:43 WrapperNode [2021-03-26 00:15:43,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:15:43,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:15:43,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:15:43,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:15:43,446 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:15:43" (1/1) ... [2021-03-26 00:15:43,479 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:15:43" (1/1) ... [2021-03-26 00:15:43,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:15:43,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:15:43,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:15:43,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:15:43,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:43" (1/1) ... [2021-03-26 00:15:43,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:43" (1/1) ... [2021-03-26 00:15:43,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:43" (1/1) ... [2021-03-26 00:15:43,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:43" (1/1) ... [2021-03-26 00:15:43,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:43" (1/1) ... [2021-03-26 00:15:43,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:43" (1/1) ... [2021-03-26 00:15:43,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:43" (1/1) ... [2021-03-26 00:15:43,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:15:43,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:15:43,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:15:43,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:15:43,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:43" (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:15:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:15:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:15:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:15:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:15:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:15:43,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:15:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:15:43,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:15:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:15:43,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:15:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:15:43,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:15:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:15:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:15:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:15:43,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:15:43,624 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:15:45,313 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:15:45,314 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:15:45,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:15:45 BoogieIcfgContainer [2021-03-26 00:15:45,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:15:45,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:15:45,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:15:45,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:15:45,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:15:42" (1/3) ... [2021-03-26 00:15:45,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdbb39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:15:45, skipping insertion in model container [2021-03-26 00:15:45,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:43" (2/3) ... [2021-03-26 00:15:45,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdbb39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:15:45, skipping insertion in model container [2021-03-26 00:15:45,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:15:45" (3/3) ... [2021-03-26 00:15:45,322 INFO L111 eAbstractionObserver]: Analyzing ICFG mix036_pso.oepc.i [2021-03-26 00:15:45,327 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:15:45,331 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:15:45,332 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:15:45,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,374 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,374 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,374 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,408 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,408 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,409 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,409 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,409 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,420 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,421 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,421 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,421 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,424 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,425 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,425 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,425 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,429 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,429 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,429 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,430 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,433 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,433 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,434 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,434 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,455 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,455 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,470 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,470 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,471 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,472 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,472 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,474 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,474 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:45,476 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:15:45,492 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:15:45,519 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:15:45,519 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:15:45,519 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:15:45,519 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:15:45,519 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:15:45,519 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:15:45,520 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:15:45,520 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:15:45,532 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 121 transitions, 262 flow [2021-03-26 00:15:45,583 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-03-26 00:15:45,583 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:45,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 00:15:45,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 121 transitions, 262 flow [2021-03-26 00:15:45,601 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 117 transitions, 246 flow [2021-03-26 00:15:45,602 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:45,612 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 117 transitions, 246 flow [2021-03-26 00:15:45,614 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 117 transitions, 246 flow [2021-03-26 00:15:45,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 246 flow [2021-03-26 00:15:45,633 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-03-26 00:15:45,633 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:45,634 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 00:15:45,637 INFO L142 LiptonReduction]: Number of co-enabled transitions 2876 [2021-03-26 00:15:47,061 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:15:47,427 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:15:47,547 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:15:48,889 INFO L154 LiptonReduction]: Checked pairs total: 5389 [2021-03-26 00:15:48,889 INFO L156 LiptonReduction]: Total number of compositions: 78 [2021-03-26 00:15:48,895 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3294 [2021-03-26 00:15:48,909 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 00:15:48,909 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:48,909 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:48,910 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:48,910 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:48,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:48,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1113703675, now seen corresponding path program 1 times [2021-03-26 00:15:48,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:48,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218159545] [2021-03-26 00:15:48,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:49,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:49,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:49,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:49,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:49,186 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:15:49,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218159545] [2021-03-26 00:15:49,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:49,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:15:49,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55509047] [2021-03-26 00:15:49,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:15:49,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:49,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:15:49,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:15:49,209 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 199 [2021-03-26 00:15:49,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:49,215 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:49,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 199 [2021-03-26 00:15:49,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:49,402 INFO L129 PetriNetUnfolder]: 133/371 cut-off events. [2021-03-26 00:15:49,402 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:49,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 371 events. 133/371 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2040 event pairs, 110 based on Foata normal form. 33/376 useless extension candidates. Maximal degree in co-relation 567. Up to 153 conditions per place. [2021-03-26 00:15:49,409 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 11 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2021-03-26 00:15:49,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 140 flow [2021-03-26 00:15:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:15:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:15:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2021-03-26 00:15:49,427 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.916247906197655 [2021-03-26 00:15:49,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2021-03-26 00:15:49,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2021-03-26 00:15:49,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:49,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2021-03-26 00:15:49,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have 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:15:49,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have 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:15:49,450 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have 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:15:49,452 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 3 states and 547 transitions. [2021-03-26 00:15:49,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 140 flow [2021-03-26 00:15:49,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:15:49,456 INFO L241 Difference]: Finished difference. Result has 57 places, 46 transitions, 104 flow [2021-03-26 00:15:49,457 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2021-03-26 00:15:49,458 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2021-03-26 00:15:49,458 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:49,458 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-26 00:15:49,459 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-26 00:15:49,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 46 transitions, 104 flow [2021-03-26 00:15:49,466 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-26 00:15:49,466 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:49,466 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:15:49,468 INFO L142 LiptonReduction]: Number of co-enabled transitions 618 [2021-03-26 00:15:51,151 INFO L154 LiptonReduction]: Checked pairs total: 2683 [2021-03-26 00:15:51,151 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-26 00:15:51,152 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1694 [2021-03-26 00:15:51,153 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 76 flow [2021-03-26 00:15:51,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:51,154 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:51,154 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:51,154 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:15:51,154 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:51,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:51,155 INFO L82 PathProgramCache]: Analyzing trace with hash 460839235, now seen corresponding path program 1 times [2021-03-26 00:15:51,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:51,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746176353] [2021-03-26 00:15:51,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:51,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:51,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:51,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:51,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:51,261 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:15:51,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:15:51,265 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:15:51,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746176353] [2021-03-26 00:15:51,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:51,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:15:51,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190101976] [2021-03-26 00:15:51,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:15:51,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:51,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:15:51,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:15:51,268 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 213 [2021-03-26 00:15:51,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:51,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:51,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 213 [2021-03-26 00:15:51,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:51,296 INFO L129 PetriNetUnfolder]: 1/34 cut-off events. [2021-03-26 00:15:51,296 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:51,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 42. Up to 3 conditions per place. [2021-03-26 00:15:51,297 INFO L132 encePairwiseOnDemand]: 209/213 looper letters, 1 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2021-03-26 00:15:51,297 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 92 flow [2021-03-26 00:15:51,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:15:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:15:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 942 transitions. [2021-03-26 00:15:51,300 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8845070422535212 [2021-03-26 00:15:51,300 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 942 transitions. [2021-03-26 00:15:51,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 942 transitions. [2021-03-26 00:15:51,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:51,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 942 transitions. [2021-03-26 00:15:51,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 188.4) internal successors, (942), 5 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have 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:15:51,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:15:51,306 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:15:51,306 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 76 flow. Second operand 5 states and 942 transitions. [2021-03-26 00:15:51,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 92 flow [2021-03-26 00:15:51,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:15:51,307 INFO L241 Difference]: Finished difference. Result has 46 places, 30 transitions, 76 flow [2021-03-26 00:15:51,307 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2021-03-26 00:15:51,308 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -15 predicate places. [2021-03-26 00:15:51,308 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:51,308 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 30 transitions, 76 flow [2021-03-26 00:15:51,308 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 30 transitions, 76 flow [2021-03-26 00:15:51,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 76 flow [2021-03-26 00:15:51,312 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-26 00:15:51,312 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:51,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:15:51,313 INFO L142 LiptonReduction]: Number of co-enabled transitions 410 [2021-03-26 00:15:52,138 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-26 00:15:52,320 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-26 00:15:52,639 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-26 00:15:52,797 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-26 00:15:52,801 INFO L154 LiptonReduction]: Checked pairs total: 1444 [2021-03-26 00:15:52,801 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:15:52,801 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1493 [2021-03-26 00:15:52,802 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2021-03-26 00:15:52,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:52,803 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:52,803 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:52,803 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:15:52,804 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:52,804 INFO L82 PathProgramCache]: Analyzing trace with hash -79801966, now seen corresponding path program 1 times [2021-03-26 00:15:52,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:52,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66724908] [2021-03-26 00:15:52,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:52,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:52,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:52,863 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:15:52,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:15:52,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:52,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:52,871 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:15:52,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66724908] [2021-03-26 00:15:52,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:52,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:15:52,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336622399] [2021-03-26 00:15:52,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:15:52,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:52,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:15:52,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:15:52,874 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 216 [2021-03-26 00:15:52,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 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:15:52,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:52,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 216 [2021-03-26 00:15:52,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:52,930 INFO L129 PetriNetUnfolder]: 90/186 cut-off events. [2021-03-26 00:15:52,931 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:52,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 186 events. 90/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 805 event pairs, 46 based on Foata normal form. 16/199 useless extension candidates. Maximal degree in co-relation 358. Up to 119 conditions per place. [2021-03-26 00:15:52,932 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 6 selfloop transitions, 5 changer transitions 9/40 dead transitions. [2021-03-26 00:15:52,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 136 flow [2021-03-26 00:15:52,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:15:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:15:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 912 transitions. [2021-03-26 00:15:52,935 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2021-03-26 00:15:52,936 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 912 transitions. [2021-03-26 00:15:52,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 912 transitions. [2021-03-26 00:15:52,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:52,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 912 transitions. [2021-03-26 00:15:52,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.4) internal successors, (912), 5 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have 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:15:52,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have 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:15:52,941 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have 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:15:52,941 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 5 states and 912 transitions. [2021-03-26 00:15:52,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 136 flow [2021-03-26 00:15:52,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:15:52,943 INFO L241 Difference]: Finished difference. Result has 44 places, 31 transitions, 111 flow [2021-03-26 00:15:52,943 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2021-03-26 00:15:52,943 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -17 predicate places. [2021-03-26 00:15:52,943 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:52,943 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 31 transitions, 111 flow [2021-03-26 00:15:52,944 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 31 transitions, 111 flow [2021-03-26 00:15:52,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 111 flow [2021-03-26 00:15:52,957 INFO L129 PetriNetUnfolder]: 73/145 cut-off events. [2021-03-26 00:15:52,957 INFO L130 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2021-03-26 00:15:52,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 145 events. 73/145 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 494 event pairs, 40 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 378. Up to 104 conditions per place. [2021-03-26 00:15:52,960 INFO L142 LiptonReduction]: Number of co-enabled transitions 446 [2021-03-26 00:15:52,972 INFO L154 LiptonReduction]: Checked pairs total: 422 [2021-03-26 00:15:52,973 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:15:52,973 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-26 00:15:52,975 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 111 flow [2021-03-26 00:15:52,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 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:15:52,976 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:52,976 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:52,976 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:15:52,977 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:52,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:52,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1225209707, now seen corresponding path program 1 times [2021-03-26 00:15:52,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:52,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510911271] [2021-03-26 00:15:52,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:53,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:53,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:53,129 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:15:53,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:15:53,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:53,136 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:15:53,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510911271] [2021-03-26 00:15:53,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:53,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:15:53,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705278925] [2021-03-26 00:15:53,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:15:53,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:53,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:15:53,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:15:53,140 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 216 [2021-03-26 00:15:53,141 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:53,141 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:53,141 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 216 [2021-03-26 00:15:53,141 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:53,210 INFO L129 PetriNetUnfolder]: 66/149 cut-off events. [2021-03-26 00:15:53,210 INFO L130 PetriNetUnfolder]: For 102/123 co-relation queries the response was YES. [2021-03-26 00:15:53,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 149 events. 66/149 cut-off events. For 102/123 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 559 event pairs, 14 based on Foata normal form. 22/168 useless extension candidates. Maximal degree in co-relation 504. Up to 108 conditions per place. [2021-03-26 00:15:53,212 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 6 selfloop transitions, 9 changer transitions 9/44 dead transitions. [2021-03-26 00:15:53,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 235 flow [2021-03-26 00:15:53,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:15:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:15:53,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2021-03-26 00:15:53,215 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8441358024691358 [2021-03-26 00:15:53,215 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1094 transitions. [2021-03-26 00:15:53,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1094 transitions. [2021-03-26 00:15:53,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:53,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1094 transitions. [2021-03-26 00:15:53,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.33333333333334) internal successors, (1094), 6 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have 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:15:53,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have 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:15:53,221 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have 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:15:53,221 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 111 flow. Second operand 6 states and 1094 transitions. [2021-03-26 00:15:53,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 235 flow [2021-03-26 00:15:53,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 228 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:15:53,225 INFO L241 Difference]: Finished difference. Result has 48 places, 35 transitions, 176 flow [2021-03-26 00:15:53,225 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2021-03-26 00:15:53,226 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -13 predicate places. [2021-03-26 00:15:53,226 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:53,226 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 35 transitions, 176 flow [2021-03-26 00:15:53,226 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 35 transitions, 176 flow [2021-03-26 00:15:53,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 176 flow [2021-03-26 00:15:53,242 INFO L129 PetriNetUnfolder]: 49/117 cut-off events. [2021-03-26 00:15:53,242 INFO L130 PetriNetUnfolder]: For 200/216 co-relation queries the response was YES. [2021-03-26 00:15:53,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 117 events. 49/117 cut-off events. For 200/216 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 421 event pairs, 13 based on Foata normal form. 4/118 useless extension candidates. Maximal degree in co-relation 436. Up to 76 conditions per place. [2021-03-26 00:15:53,273 INFO L142 LiptonReduction]: Number of co-enabled transitions 530 [2021-03-26 00:15:53,294 INFO L154 LiptonReduction]: Checked pairs total: 503 [2021-03-26 00:15:53,294 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:15:53,295 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 69 [2021-03-26 00:15:53,296 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 176 flow [2021-03-26 00:15:53,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:53,297 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:53,297 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:15:53,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:15:53,298 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:53,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:53,298 INFO L82 PathProgramCache]: Analyzing trace with hash 598660123, now seen corresponding path program 1 times [2021-03-26 00:15:53,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:53,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532907252] [2021-03-26 00:15:53,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:53,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:53,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:53,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:53,464 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:15:53,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:15:53,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:15:53,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532907252] [2021-03-26 00:15:53,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:53,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:15:53,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77256790] [2021-03-26 00:15:53,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:15:53,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:53,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:15:53,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:15:53,472 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 216 [2021-03-26 00:15:53,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have 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:15:53,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:53,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 216 [2021-03-26 00:15:53,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:53,542 INFO L129 PetriNetUnfolder]: 36/97 cut-off events. [2021-03-26 00:15:53,542 INFO L130 PetriNetUnfolder]: For 204/246 co-relation queries the response was YES. [2021-03-26 00:15:53,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 97 events. 36/97 cut-off events. For 204/246 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 280 event pairs, 2 based on Foata normal form. 25/119 useless extension candidates. Maximal degree in co-relation 432. Up to 68 conditions per place. [2021-03-26 00:15:53,544 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 6 selfloop transitions, 13 changer transitions 9/48 dead transitions. [2021-03-26 00:15:53,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 358 flow [2021-03-26 00:15:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:15:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:15:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1276 transitions. [2021-03-26 00:15:53,548 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.843915343915344 [2021-03-26 00:15:53,548 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1276 transitions. [2021-03-26 00:15:53,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1276 transitions. [2021-03-26 00:15:53,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:53,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1276 transitions. [2021-03-26 00:15:53,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 182.28571428571428) internal successors, (1276), 7 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have 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:15:53,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have 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:15:53,554 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have 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:15:53,555 INFO L185 Difference]: Start difference. First operand has 46 places, 35 transitions, 176 flow. Second operand 7 states and 1276 transitions. [2021-03-26 00:15:53,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 358 flow [2021-03-26 00:15:53,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 296 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 00:15:53,561 INFO L241 Difference]: Finished difference. Result has 51 places, 39 transitions, 226 flow [2021-03-26 00:15:53,561 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2021-03-26 00:15:53,562 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -10 predicate places. [2021-03-26 00:15:53,562 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:53,562 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 39 transitions, 226 flow [2021-03-26 00:15:53,562 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 39 transitions, 226 flow [2021-03-26 00:15:53,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 226 flow [2021-03-26 00:15:53,572 INFO L129 PetriNetUnfolder]: 25/75 cut-off events. [2021-03-26 00:15:53,572 INFO L130 PetriNetUnfolder]: For 160/176 co-relation queries the response was YES. [2021-03-26 00:15:53,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 75 events. 25/75 cut-off events. For 160/176 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 184 event pairs, 2 based on Foata normal form. 4/76 useless extension candidates. Maximal degree in co-relation 271. Up to 42 conditions per place. [2021-03-26 00:15:53,573 INFO L142 LiptonReduction]: Number of co-enabled transitions 530 [2021-03-26 00:15:53,578 INFO L154 LiptonReduction]: Checked pairs total: 613 [2021-03-26 00:15:53,578 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:15:53,578 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-26 00:15:53,579 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 226 flow [2021-03-26 00:15:53,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have 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:15:53,579 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:53,580 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:53,580 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:15:53,580 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:53,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:53,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1278353626, now seen corresponding path program 1 times [2021-03-26 00:15:53,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:53,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156835945] [2021-03-26 00:15:53,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:53,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:53,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:53,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:53,638 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:15:53,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:15:53,648 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:15:53,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156835945] [2021-03-26 00:15:53,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:53,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:15:53,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977218218] [2021-03-26 00:15:53,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:15:53,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:53,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:15:53,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:15:53,650 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 216 [2021-03-26 00:15:53,651 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 174.4) internal successors, (872), 5 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have 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:15:53,651 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:53,651 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 216 [2021-03-26 00:15:53,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:53,731 INFO L129 PetriNetUnfolder]: 151/377 cut-off events. [2021-03-26 00:15:53,731 INFO L130 PetriNetUnfolder]: For 780/863 co-relation queries the response was YES. [2021-03-26 00:15:53,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 377 events. 151/377 cut-off events. For 780/863 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2093 event pairs, 8 based on Foata normal form. 32/391 useless extension candidates. Maximal degree in co-relation 1232. Up to 165 conditions per place. [2021-03-26 00:15:53,735 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 14 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2021-03-26 00:15:53,735 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 316 flow [2021-03-26 00:15:53,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:15:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:15:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1064 transitions. [2021-03-26 00:15:53,738 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8209876543209876 [2021-03-26 00:15:53,738 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1064 transitions. [2021-03-26 00:15:53,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1064 transitions. [2021-03-26 00:15:53,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:53,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1064 transitions. [2021-03-26 00:15:53,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 177.33333333333334) internal successors, (1064), 6 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have 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:15:53,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have 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:15:53,743 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have 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:15:53,743 INFO L185 Difference]: Start difference. First operand has 49 places, 39 transitions, 226 flow. Second operand 6 states and 1064 transitions. [2021-03-26 00:15:53,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 316 flow [2021-03-26 00:15:53,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 262 flow, removed 18 selfloop flow, removed 5 redundant places. [2021-03-26 00:15:53,749 INFO L241 Difference]: Finished difference. Result has 52 places, 48 transitions, 240 flow [2021-03-26 00:15:53,749 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2021-03-26 00:15:53,749 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2021-03-26 00:15:53,749 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:53,750 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 48 transitions, 240 flow [2021-03-26 00:15:53,750 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 48 transitions, 240 flow [2021-03-26 00:15:53,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 48 transitions, 240 flow [2021-03-26 00:15:53,779 INFO L129 PetriNetUnfolder]: 120/296 cut-off events. [2021-03-26 00:15:53,780 INFO L130 PetriNetUnfolder]: For 356/393 co-relation queries the response was YES. [2021-03-26 00:15:53,781 INFO L84 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 296 events. 120/296 cut-off events. For 356/393 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1446 event pairs, 13 based on Foata normal form. 18/300 useless extension candidates. Maximal degree in co-relation 825. Up to 115 conditions per place. [2021-03-26 00:15:53,783 INFO L142 LiptonReduction]: Number of co-enabled transitions 608 [2021-03-26 00:15:54,064 INFO L154 LiptonReduction]: Checked pairs total: 1118 [2021-03-26 00:15:54,064 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:15:54,064 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 315 [2021-03-26 00:15:54,071 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 242 flow [2021-03-26 00:15:54,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 174.4) internal successors, (872), 5 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have 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:15:54,071 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:54,071 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:54,072 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:15:54,072 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:54,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:54,072 INFO L82 PathProgramCache]: Analyzing trace with hash -42575642, now seen corresponding path program 2 times [2021-03-26 00:15:54,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:54,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865957543] [2021-03-26 00:15:54,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:54,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:54,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:54,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:54,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:54,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:54,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:54,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:54,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:54,217 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:15:54,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:15:54,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:54,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:54,223 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:15:54,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865957543] [2021-03-26 00:15:54,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:54,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:15:54,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282418938] [2021-03-26 00:15:54,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:15:54,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:54,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:15:54,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:15:54,226 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 217 [2021-03-26 00:15:54,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 242 flow. Second operand has 7 states, 7 states have (on average 179.85714285714286) internal successors, (1259), 7 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have 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:15:54,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:54,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 217 [2021-03-26 00:15:54,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:54,308 INFO L129 PetriNetUnfolder]: 77/208 cut-off events. [2021-03-26 00:15:54,308 INFO L130 PetriNetUnfolder]: For 356/509 co-relation queries the response was YES. [2021-03-26 00:15:54,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 208 events. 77/208 cut-off events. For 356/509 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 983 event pairs, 6 based on Foata normal form. 83/279 useless extension candidates. Maximal degree in co-relation 702. Up to 79 conditions per place. [2021-03-26 00:15:54,310 INFO L132 encePairwiseOnDemand]: 210/217 looper letters, 2 selfloop transitions, 18 changer transitions 5/53 dead transitions. [2021-03-26 00:15:54,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 338 flow [2021-03-26 00:15:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:15:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:15:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1458 transitions. [2021-03-26 00:15:54,313 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8398617511520737 [2021-03-26 00:15:54,314 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1458 transitions. [2021-03-26 00:15:54,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1458 transitions. [2021-03-26 00:15:54,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:54,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1458 transitions. [2021-03-26 00:15:54,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 182.25) internal successors, (1458), 8 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have 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:15:54,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have 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:15:54,319 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have 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:15:54,320 INFO L185 Difference]: Start difference. First operand has 52 places, 48 transitions, 242 flow. Second operand 8 states and 1458 transitions. [2021-03-26 00:15:54,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 338 flow [2021-03-26 00:15:54,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 314 flow, removed 10 selfloop flow, removed 1 redundant places. [2021-03-26 00:15:54,324 INFO L241 Difference]: Finished difference. Result has 61 places, 48 transitions, 281 flow [2021-03-26 00:15:54,324 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=281, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2021-03-26 00:15:54,324 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2021-03-26 00:15:54,325 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:54,325 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 48 transitions, 281 flow [2021-03-26 00:15:54,325 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 48 transitions, 281 flow [2021-03-26 00:15:54,325 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 281 flow [2021-03-26 00:15:54,350 INFO L129 PetriNetUnfolder]: 98/251 cut-off events. [2021-03-26 00:15:54,350 INFO L130 PetriNetUnfolder]: For 409/440 co-relation queries the response was YES. [2021-03-26 00:15:54,352 INFO L84 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 251 events. 98/251 cut-off events. For 409/440 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1276 event pairs, 6 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 831. Up to 93 conditions per place. [2021-03-26 00:15:54,354 INFO L142 LiptonReduction]: Number of co-enabled transitions 540 [2021-03-26 00:15:54,662 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:15:54,806 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:15:54,940 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-26 00:15:55,173 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-26 00:15:55,313 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-26 00:15:55,321 INFO L154 LiptonReduction]: Checked pairs total: 1297 [2021-03-26 00:15:55,321 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:15:55,321 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 996 [2021-03-26 00:15:55,322 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 265 flow [2021-03-26 00:15:55,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 179.85714285714286) internal successors, (1259), 7 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have 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:15:55,322 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:55,322 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:55,323 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:15:55,323 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:55,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:55,323 INFO L82 PathProgramCache]: Analyzing trace with hash 822792791, now seen corresponding path program 1 times [2021-03-26 00:15:55,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:55,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751796800] [2021-03-26 00:15:55,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:55,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:55,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:55,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:55,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:55,391 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:15:55,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:15:55,399 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:15:55,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751796800] [2021-03-26 00:15:55,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:55,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:15:55,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504097847] [2021-03-26 00:15:55,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:15:55,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:55,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:15:55,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:15:55,402 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 219 [2021-03-26 00:15:55,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 265 flow. Second operand has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have 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:15:55,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:55,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 219 [2021-03-26 00:15:55,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:55,487 INFO L129 PetriNetUnfolder]: 158/371 cut-off events. [2021-03-26 00:15:55,487 INFO L130 PetriNetUnfolder]: For 1172/1327 co-relation queries the response was YES. [2021-03-26 00:15:55,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 371 events. 158/371 cut-off events. For 1172/1327 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2089 event pairs, 7 based on Foata normal form. 28/372 useless extension candidates. Maximal degree in co-relation 1226. Up to 118 conditions per place. [2021-03-26 00:15:55,491 INFO L132 encePairwiseOnDemand]: 212/219 looper letters, 8 selfloop transitions, 12 changer transitions 2/53 dead transitions. [2021-03-26 00:15:55,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 343 flow [2021-03-26 00:15:55,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:15:55,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:15:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 882 transitions. [2021-03-26 00:15:55,493 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8054794520547945 [2021-03-26 00:15:55,493 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 882 transitions. [2021-03-26 00:15:55,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 882 transitions. [2021-03-26 00:15:55,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:55,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 882 transitions. [2021-03-26 00:15:55,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.4) internal successors, (882), 5 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have 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:15:55,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have 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:15:55,497 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have 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:15:55,498 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 265 flow. Second operand 5 states and 882 transitions. [2021-03-26 00:15:55,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 343 flow [2021-03-26 00:15:55,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 287 flow, removed 15 selfloop flow, removed 7 redundant places. [2021-03-26 00:15:55,504 INFO L241 Difference]: Finished difference. Result has 56 places, 49 transitions, 273 flow [2021-03-26 00:15:55,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2021-03-26 00:15:55,505 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2021-03-26 00:15:55,505 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:55,505 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 49 transitions, 273 flow [2021-03-26 00:15:55,505 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 49 transitions, 273 flow [2021-03-26 00:15:55,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 273 flow [2021-03-26 00:15:55,541 INFO L129 PetriNetUnfolder]: 161/400 cut-off events. [2021-03-26 00:15:55,542 INFO L130 PetriNetUnfolder]: For 490/511 co-relation queries the response was YES. [2021-03-26 00:15:55,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 400 events. 161/400 cut-off events. For 490/511 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2464 event pairs, 17 based on Foata normal form. 6/382 useless extension candidates. Maximal degree in co-relation 1114. Up to 114 conditions per place. [2021-03-26 00:15:55,547 INFO L142 LiptonReduction]: Number of co-enabled transitions 596 [2021-03-26 00:15:55,623 INFO L154 LiptonReduction]: Checked pairs total: 559 [2021-03-26 00:15:55,623 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:15:55,623 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 118 [2021-03-26 00:15:55,624 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 273 flow [2021-03-26 00:15:55,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have 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:15:55,625 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:55,625 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:55,625 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:15:55,625 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:55,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:55,626 INFO L82 PathProgramCache]: Analyzing trace with hash 939522354, now seen corresponding path program 1 times [2021-03-26 00:15:55,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:55,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800200829] [2021-03-26 00:15:55,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:55,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:55,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:55,708 INFO L142 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size [2021-03-26 00:15:55,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:15:55,719 INFO L142 QuantifierPusher]: treesize reduction 10, result has 54.5 percent of original size [2021-03-26 00:15:55,720 INFO L147 QuantifierPusher]: treesize reduction 9, result has 25.0 percent of original size 3 [2021-03-26 00:15:55,731 INFO L142 QuantifierPusher]: treesize reduction 10, result has 56.5 percent of original size [2021-03-26 00:15:55,732 INFO L147 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size 9 [2021-03-26 00:15:55,745 INFO L142 QuantifierPusher]: treesize reduction 14, result has 39.1 percent of original size [2021-03-26 00:15:55,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:15:55,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:55,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:15:55,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:55,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:15:55,778 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:15:55,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800200829] [2021-03-26 00:15:55,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:55,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 00:15:55,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484165689] [2021-03-26 00:15:55,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:15:55,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:55,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:15:55,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:15:55,781 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 219 [2021-03-26 00:15:55,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 273 flow. Second operand has 8 states, 8 states have (on average 155.625) internal successors, (1245), 8 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have 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:15:55,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:55,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 219 [2021-03-26 00:15:55,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:56,644 INFO L129 PetriNetUnfolder]: 2409/4626 cut-off events. [2021-03-26 00:15:56,644 INFO L130 PetriNetUnfolder]: For 9662/10209 co-relation queries the response was YES. [2021-03-26 00:15:56,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13826 conditions, 4626 events. 2409/4626 cut-off events. For 9662/10209 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 37867 event pairs, 245 based on Foata normal form. 252/4701 useless extension candidates. Maximal degree in co-relation 13805. Up to 1002 conditions per place. [2021-03-26 00:15:56,684 INFO L132 encePairwiseOnDemand]: 206/219 looper letters, 77 selfloop transitions, 33 changer transitions 0/135 dead transitions. [2021-03-26 00:15:56,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 135 transitions, 970 flow [2021-03-26 00:15:56,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-26 00:15:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-26 00:15:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1929 transitions. [2021-03-26 00:15:56,689 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7340182648401826 [2021-03-26 00:15:56,689 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1929 transitions. [2021-03-26 00:15:56,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1929 transitions. [2021-03-26 00:15:56,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:56,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1929 transitions. [2021-03-26 00:15:56,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 160.75) internal successors, (1929), 12 states have internal predecessors, (1929), 0 states have call successors, (0), 0 states have 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:15:56,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 219.0) internal successors, (2847), 13 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have 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:15:56,698 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 219.0) internal successors, (2847), 13 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have 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:15:56,699 INFO L185 Difference]: Start difference. First operand has 56 places, 49 transitions, 273 flow. Second operand 12 states and 1929 transitions. [2021-03-26 00:15:56,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 135 transitions, 970 flow [2021-03-26 00:15:56,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 135 transitions, 934 flow, removed 12 selfloop flow, removed 1 redundant places. [2021-03-26 00:15:56,943 INFO L241 Difference]: Finished difference. Result has 72 places, 75 transitions, 504 flow [2021-03-26 00:15:56,943 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=504, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2021-03-26 00:15:56,943 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2021-03-26 00:15:56,943 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:56,943 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 75 transitions, 504 flow [2021-03-26 00:15:56,943 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 75 transitions, 504 flow [2021-03-26 00:15:56,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 75 transitions, 504 flow [2021-03-26 00:15:57,271 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1088] L810-->L817: Formula: (let ((.cse11 (= (mod v_~b$w_buff0_used~0_407 256) 0)) (.cse12 (= (mod v_~b$r_buff0_thd3~0_72 256) 0)) (.cse9 (= (mod v_~b$r_buff1_thd3~0_50 256) 0)) (.cse14 (= (mod v_~b$w_buff1_used~0_308 256) 0)) (.cse13 (= (mod v_~b$w_buff0_used~0_408 256) 0))) (let ((.cse1 (not .cse13)) (.cse6 (not .cse14)) (.cse4 (or .cse14 .cse9)) (.cse2 (or .cse13 .cse12)) (.cse5 (not .cse9)) (.cse0 (not .cse12)) (.cse7 (not .cse11)) (.cse3 (or .cse12 .cse11))) (and (or (and .cse0 (= v_~b$w_buff0_used~0_407 0) .cse1) (and (= v_~b$w_buff0_used~0_408 v_~b$w_buff0_used~0_407) .cse2)) (or (and .cse3 .cse4 (= v_~b$w_buff1_used~0_308 v_~b$w_buff1_used~0_307)) (and (or (and .cse5 .cse6) (and .cse0 .cse7)) (= v_~b$w_buff1_used~0_307 0))) (or (and (= |v_P2Thread1of1ForFork3_#t~ite17_1| |v_P2_#t~ite17_33|) (= v_~b~0_116 v_~b$w_buff0~0_81) .cse0 .cse1) (and (or (and .cse5 .cse6 (= |v_P2_#t~ite17_33| v_~b$w_buff1~0_84)) (and .cse4 (= |v_P2_#t~ite17_33| v_~b~0_117))) (= |v_P2_#t~ite17_33| v_~b~0_116) .cse2)) (let ((.cse8 (= (mod v_~b$w_buff1_used~0_307 256) 0)) (.cse10 (= (mod v_~b$r_buff0_thd3~0_71 256) 0))) (or (and (= v_~b$r_buff1_thd3~0_50 v_~b$r_buff1_thd3~0_49) (or .cse8 .cse9) (or .cse10 .cse11)) (and (or (and .cse5 (not .cse8)) (and .cse7 (not .cse10))) (= v_~b$r_buff1_thd3~0_49 0)))) (or (and (= v_~b$r_buff0_thd3~0_71 0) .cse0 .cse7) (and (= v_~b$r_buff0_thd3~0_72 v_~b$r_buff0_thd3~0_71) .cse3))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_408, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_308, ~b~0=v_~b~0_117, ~b$w_buff1~0=v_~b$w_buff1~0_84, ~b$w_buff0~0=v_~b$w_buff0~0_81, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_50, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_71, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_407, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_307, ~b~0=v_~b~0_116, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~b$w_buff1~0=v_~b$w_buff1~0_84, ~b$w_buff0~0=v_~b$w_buff0~0_81, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_49, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_33|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, P2Thread1of1ForFork3_#t~ite20, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~b$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][33], [448#true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, Black: 262#(<= ~__unbuffered_cnt~0 2), Black: 393#(<= ~__unbuffered_cnt~0 3), 81#L770true, 339#(and (= ~x~0 1) (= ~__unbuffered_p0_EAX~0 1)), Black: 337#(and (= ~x~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 465#(and (not (= ~__unbuffered_p1_EAX~0 0)) (= ~b$w_buff0_used~0 0) (not (= ~y~0 0))), Black: 335#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 450#(and (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1)), Black: 451#(= ~b$w_buff0_used~0 0), Black: 467#(and (not (= ~__unbuffered_p1_EAX~0 0)) (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1)), Black: 457#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b$w_buff0_used~0 0)), Black: 461#(and (= ~b$w_buff0_used~0 0) (not (= ~y~0 0))), 231#(= ~__unbuffered_cnt~0 0), Black: 232#(<= ~__unbuffered_cnt~0 1), 110#L797true, 47#L856true, 54#L817true, 442#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 1)), Black: 439#(= ~z~0 1), 127#L880-1true]) [2021-03-26 00:15:57,272 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 00:15:57,272 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 00:15:57,272 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 00:15:57,272 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 00:15:57,405 INFO L129 PetriNetUnfolder]: 1763/3777 cut-off events. [2021-03-26 00:15:57,405 INFO L130 PetriNetUnfolder]: For 4864/5195 co-relation queries the response was YES. [2021-03-26 00:15:57,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11910 conditions, 3777 events. 1763/3777 cut-off events. For 4864/5195 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 33763 event pairs, 399 based on Foata normal form. 56/3646 useless extension candidates. Maximal degree in co-relation 11884. Up to 1173 conditions per place. [2021-03-26 00:15:57,466 INFO L142 LiptonReduction]: Number of co-enabled transitions 926 [2021-03-26 00:15:57,528 INFO L154 LiptonReduction]: Checked pairs total: 6 [2021-03-26 00:15:57,528 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:15:57,528 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 585 [2021-03-26 00:15:57,530 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 506 flow [2021-03-26 00:15:57,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 155.625) internal successors, (1245), 8 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have 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:15:57,530 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:57,531 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:57,531 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:15:57,531 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:57,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:57,531 INFO L82 PathProgramCache]: Analyzing trace with hash -2069162940, now seen corresponding path program 2 times [2021-03-26 00:15:57,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:57,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806012137] [2021-03-26 00:15:57,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:57,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:57,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:57,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:57,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:57,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:57,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:57,589 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:15:57,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806012137] [2021-03-26 00:15:57,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:57,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:15:57,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033327671] [2021-03-26 00:15:57,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:15:57,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:57,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:15:57,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:15:57,592 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 221 [2021-03-26 00:15:57,592 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 506 flow. Second operand has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:57,592 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:57,592 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 221 [2021-03-26 00:15:57,592 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:58,161 INFO L129 PetriNetUnfolder]: 2220/4638 cut-off events. [2021-03-26 00:15:58,161 INFO L130 PetriNetUnfolder]: For 6635/7161 co-relation queries the response was YES. [2021-03-26 00:15:58,192 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14717 conditions, 4638 events. 2220/4638 cut-off events. For 6635/7161 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 41584 event pairs, 522 based on Foata normal form. 80/4386 useless extension candidates. Maximal degree in co-relation 14689. Up to 1462 conditions per place. [2021-03-26 00:15:58,201 INFO L132 encePairwiseOnDemand]: 216/221 looper letters, 3 selfloop transitions, 5 changer transitions 21/76 dead transitions. [2021-03-26 00:15:58,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 76 transitions, 538 flow [2021-03-26 00:15:58,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:15:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:15:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 752 transitions. [2021-03-26 00:15:58,204 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8506787330316742 [2021-03-26 00:15:58,204 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 752 transitions. [2021-03-26 00:15:58,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 752 transitions. [2021-03-26 00:15:58,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:58,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 752 transitions. [2021-03-26 00:15:58,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have 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:15:58,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have 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:15:58,208 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have 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:15:58,208 INFO L185 Difference]: Start difference. First operand has 72 places, 75 transitions, 506 flow. Second operand 4 states and 752 transitions. [2021-03-26 00:15:58,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 76 transitions, 538 flow [2021-03-26 00:15:58,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 76 transitions, 532 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:15:58,454 INFO L241 Difference]: Finished difference. Result has 76 places, 55 transitions, 369 flow [2021-03-26 00:15:58,454 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=369, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2021-03-26 00:15:58,455 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 15 predicate places. [2021-03-26 00:15:58,455 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:58,455 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 55 transitions, 369 flow [2021-03-26 00:15:58,455 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 55 transitions, 369 flow [2021-03-26 00:15:58,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 55 transitions, 369 flow [2021-03-26 00:15:58,631 INFO L129 PetriNetUnfolder]: 610/1433 cut-off events. [2021-03-26 00:15:58,632 INFO L130 PetriNetUnfolder]: For 2035/2251 co-relation queries the response was YES. [2021-03-26 00:15:58,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4549 conditions, 1433 events. 610/1433 cut-off events. For 2035/2251 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11357 event pairs, 148 based on Foata normal form. 18/1362 useless extension candidates. Maximal degree in co-relation 4521. Up to 454 conditions per place. [2021-03-26 00:15:58,654 INFO L142 LiptonReduction]: Number of co-enabled transitions 570 [2021-03-26 00:15:58,673 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:15:58,673 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:15:58,673 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 218 [2021-03-26 00:15:58,674 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 55 transitions, 369 flow [2021-03-26 00:15:58,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:58,674 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:58,674 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:58,675 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:15:58,675 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:58,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:58,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2117064896, now seen corresponding path program 3 times [2021-03-26 00:15:58,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:58,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401611443] [2021-03-26 00:15:58,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:58,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:58,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:58,739 INFO L142 QuantifierPusher]: treesize reduction 4, result has 86.7 percent of original size [2021-03-26 00:15:58,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 00:15:58,754 INFO L142 QuantifierPusher]: treesize reduction 10, result has 67.7 percent of original size [2021-03-26 00:15:58,755 INFO L147 QuantifierPusher]: treesize reduction 5, result has 76.2 percent of original size 16 [2021-03-26 00:15:58,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:58,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:15:58,777 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:15:58,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401611443] [2021-03-26 00:15:58,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:58,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:15:58,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666049509] [2021-03-26 00:15:58,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:15:58,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:58,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:15:58,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:15:58,780 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 221 [2021-03-26 00:15:58,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 55 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:58,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:58,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 221 [2021-03-26 00:15:58,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:59,137 INFO L129 PetriNetUnfolder]: 805/1851 cut-off events. [2021-03-26 00:15:59,138 INFO L130 PetriNetUnfolder]: For 4564/5258 co-relation queries the response was YES. [2021-03-26 00:15:59,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6356 conditions, 1851 events. 805/1851 cut-off events. For 4564/5258 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 14913 event pairs, 86 based on Foata normal form. 180/1913 useless extension candidates. Maximal degree in co-relation 6326. Up to 560 conditions per place. [2021-03-26 00:15:59,154 INFO L132 encePairwiseOnDemand]: 214/221 looper letters, 11 selfloop transitions, 12 changer transitions 8/70 dead transitions. [2021-03-26 00:15:59,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 70 transitions, 527 flow [2021-03-26 00:15:59,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:15:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:15:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1172 transitions. [2021-03-26 00:15:59,158 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7575953458306399 [2021-03-26 00:15:59,158 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1172 transitions. [2021-03-26 00:15:59,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1172 transitions. [2021-03-26 00:15:59,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:59,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1172 transitions. [2021-03-26 00:15:59,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 167.42857142857142) internal successors, (1172), 7 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have 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:15:59,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have 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:15:59,163 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have 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:15:59,163 INFO L185 Difference]: Start difference. First operand has 72 places, 55 transitions, 369 flow. Second operand 7 states and 1172 transitions. [2021-03-26 00:15:59,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 70 transitions, 527 flow [2021-03-26 00:15:59,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 466 flow, removed 24 selfloop flow, removed 6 redundant places. [2021-03-26 00:15:59,223 INFO L241 Difference]: Finished difference. Result has 75 places, 60 transitions, 407 flow [2021-03-26 00:15:59,223 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=407, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2021-03-26 00:15:59,224 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2021-03-26 00:15:59,224 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:59,224 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 60 transitions, 407 flow [2021-03-26 00:15:59,224 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 60 transitions, 407 flow [2021-03-26 00:15:59,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 60 transitions, 407 flow [2021-03-26 00:15:59,362 INFO L129 PetriNetUnfolder]: 571/1358 cut-off events. [2021-03-26 00:15:59,362 INFO L130 PetriNetUnfolder]: For 1988/2117 co-relation queries the response was YES. [2021-03-26 00:15:59,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4338 conditions, 1358 events. 571/1358 cut-off events. For 1988/2117 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 10703 event pairs, 100 based on Foata normal form. 25/1295 useless extension candidates. Maximal degree in co-relation 4310. Up to 422 conditions per place. [2021-03-26 00:15:59,382 INFO L142 LiptonReduction]: Number of co-enabled transitions 632 [2021-03-26 00:15:59,408 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:15:59,408 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:15:59,408 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 184 [2021-03-26 00:15:59,409 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 407 flow [2021-03-26 00:15:59,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:59,422 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:59,422 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:59,422 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:15:59,422 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:59,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:59,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1202359092, now seen corresponding path program 4 times [2021-03-26 00:15:59,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:59,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542023328] [2021-03-26 00:15:59,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:59,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:59,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:15:59,518 INFO L142 QuantifierPusher]: treesize reduction 4, result has 89.7 percent of original size [2021-03-26 00:15:59,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 00:15:59,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:59,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:15:59,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:59,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:15:59,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:59,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:59,569 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:15:59,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542023328] [2021-03-26 00:15:59,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:59,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:15:59,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178835719] [2021-03-26 00:15:59,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:15:59,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:59,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:15:59,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:15:59,572 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 221 [2021-03-26 00:15:59,573 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 407 flow. Second operand has 7 states, 7 states have (on average 163.14285714285714) internal successors, (1142), 7 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have 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:15:59,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:59,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 221 [2021-03-26 00:15:59,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:59,894 INFO L129 PetriNetUnfolder]: 720/1661 cut-off events. [2021-03-26 00:15:59,895 INFO L130 PetriNetUnfolder]: For 4653/5338 co-relation queries the response was YES. [2021-03-26 00:15:59,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5673 conditions, 1661 events. 720/1661 cut-off events. For 4653/5338 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 13046 event pairs, 56 based on Foata normal form. 187/1734 useless extension candidates. Maximal degree in co-relation 5643. Up to 490 conditions per place. [2021-03-26 00:15:59,908 INFO L132 encePairwiseOnDemand]: 215/221 looper letters, 17 selfloop transitions, 15 changer transitions 3/72 dead transitions. [2021-03-26 00:15:59,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 72 transitions, 549 flow [2021-03-26 00:15:59,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:15:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:15:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1155 transitions. [2021-03-26 00:15:59,911 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.746606334841629 [2021-03-26 00:15:59,911 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1155 transitions. [2021-03-26 00:15:59,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1155 transitions. [2021-03-26 00:15:59,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:59,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1155 transitions. [2021-03-26 00:15:59,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have 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:15:59,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have 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:15:59,916 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have 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:15:59,916 INFO L185 Difference]: Start difference. First operand has 73 places, 60 transitions, 407 flow. Second operand 7 states and 1155 transitions. [2021-03-26 00:15:59,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 72 transitions, 549 flow [2021-03-26 00:15:59,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 72 transitions, 546 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:15:59,965 INFO L241 Difference]: Finished difference. Result has 80 places, 63 transitions, 473 flow [2021-03-26 00:15:59,965 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=473, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2021-03-26 00:15:59,965 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 19 predicate places. [2021-03-26 00:15:59,965 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:59,966 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 63 transitions, 473 flow [2021-03-26 00:15:59,966 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 63 transitions, 473 flow [2021-03-26 00:15:59,966 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 63 transitions, 473 flow [2021-03-26 00:16:00,081 INFO L129 PetriNetUnfolder]: 527/1244 cut-off events. [2021-03-26 00:16:00,081 INFO L130 PetriNetUnfolder]: For 2363/2530 co-relation queries the response was YES. [2021-03-26 00:16:00,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4226 conditions, 1244 events. 527/1244 cut-off events. For 2363/2530 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9513 event pairs, 68 based on Foata normal form. 34/1207 useless extension candidates. Maximal degree in co-relation 4195. Up to 360 conditions per place. [2021-03-26 00:16:00,098 INFO L142 LiptonReduction]: Number of co-enabled transitions 644 [2021-03-26 00:16:01,117 WARN L205 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-26 00:16:01,912 WARN L205 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 203 [2021-03-26 00:16:04,124 WARN L205 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 377 DAG size of output: 316 [2021-03-26 00:16:05,021 WARN L205 SmtUtils]: Spent 893.00 ms on a formula simplification that was a NOOP. DAG size: 307 [2021-03-26 00:16:05,041 INFO L154 LiptonReduction]: Checked pairs total: 15 [2021-03-26 00:16:05,041 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:16:05,041 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5076 [2021-03-26 00:16:05,042 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 63 transitions, 473 flow [2021-03-26 00:16:05,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 163.14285714285714) internal successors, (1142), 7 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have 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:16:05,042 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:05,042 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:05,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:16:05,043 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:05,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:05,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1062257734, now seen corresponding path program 5 times [2021-03-26 00:16:05,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:05,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804855675] [2021-03-26 00:16:05,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:05,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:05,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:16:05,129 INFO L142 QuantifierPusher]: treesize reduction 4, result has 88.9 percent of original size [2021-03-26 00:16:05,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 00:16:05,151 INFO L142 QuantifierPusher]: treesize reduction 10, result has 73.0 percent of original size [2021-03-26 00:16:05,153 INFO L147 QuantifierPusher]: treesize reduction 5, result has 81.5 percent of original size 22 [2021-03-26 00:16:05,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:05,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:16:05,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:05,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 00:16:05,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:05,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:16:05,209 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:16:05,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804855675] [2021-03-26 00:16:05,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:05,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:16:05,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235723654] [2021-03-26 00:16:05,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:16:05,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:05,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:16:05,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:16:05,212 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 222 [2021-03-26 00:16:05,213 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 63 transitions, 473 flow. Second operand has 8 states, 8 states have (on average 161.0) internal successors, (1288), 8 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have 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:16:05,213 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:05,213 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 222 [2021-03-26 00:16:05,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:05,554 INFO L129 PetriNetUnfolder]: 547/1278 cut-off events. [2021-03-26 00:16:05,555 INFO L130 PetriNetUnfolder]: For 4247/4944 co-relation queries the response was YES. [2021-03-26 00:16:05,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4656 conditions, 1278 events. 547/1278 cut-off events. For 4247/4944 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 9507 event pairs, 21 based on Foata normal form. 190/1367 useless extension candidates. Maximal degree in co-relation 4624. Up to 374 conditions per place. [2021-03-26 00:16:05,567 INFO L132 encePairwiseOnDemand]: 216/222 looper letters, 19 selfloop transitions, 13 changer transitions 4/73 dead transitions. [2021-03-26 00:16:05,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 73 transitions, 619 flow [2021-03-26 00:16:05,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:16:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:16:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 980 transitions. [2021-03-26 00:16:05,570 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7357357357357357 [2021-03-26 00:16:05,570 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 980 transitions. [2021-03-26 00:16:05,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 980 transitions. [2021-03-26 00:16:05,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:05,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 980 transitions. [2021-03-26 00:16:05,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 163.33333333333334) internal successors, (980), 6 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have 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:16:05,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have 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:16:05,574 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have 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:16:05,574 INFO L185 Difference]: Start difference. First operand has 78 places, 63 transitions, 473 flow. Second operand 6 states and 980 transitions. [2021-03-26 00:16:05,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 73 transitions, 619 flow [2021-03-26 00:16:05,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 73 transitions, 591 flow, removed 9 selfloop flow, removed 3 redundant places. [2021-03-26 00:16:05,604 INFO L241 Difference]: Finished difference. Result has 81 places, 65 transitions, 510 flow [2021-03-26 00:16:05,604 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2021-03-26 00:16:05,604 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 20 predicate places. [2021-03-26 00:16:05,605 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:05,605 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 65 transitions, 510 flow [2021-03-26 00:16:05,605 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 65 transitions, 510 flow [2021-03-26 00:16:05,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 65 transitions, 510 flow [2021-03-26 00:16:05,721 INFO L129 PetriNetUnfolder]: 547/1285 cut-off events. [2021-03-26 00:16:05,721 INFO L130 PetriNetUnfolder]: For 2742/2974 co-relation queries the response was YES. [2021-03-26 00:16:05,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4303 conditions, 1285 events. 547/1285 cut-off events. For 2742/2974 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 9955 event pairs, 67 based on Foata normal form. 35/1240 useless extension candidates. Maximal degree in co-relation 4272. Up to 376 conditions per place. [2021-03-26 00:16:05,747 INFO L142 LiptonReduction]: Number of co-enabled transitions 664 [2021-03-26 00:16:06,712 WARN L205 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-26 00:16:07,497 WARN L205 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 203 [2021-03-26 00:16:09,634 WARN L205 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 377 DAG size of output: 320 [2021-03-26 00:16:10,646 WARN L205 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 309 [2021-03-26 00:16:10,673 INFO L154 LiptonReduction]: Checked pairs total: 15 [2021-03-26 00:16:10,674 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:16:10,674 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5069 [2021-03-26 00:16:10,675 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 65 transitions, 510 flow [2021-03-26 00:16:10,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 161.0) internal successors, (1288), 8 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have 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:16:10,675 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:10,675 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:10,675 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:16:10,675 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:10,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1187474548, now seen corresponding path program 6 times [2021-03-26 00:16:10,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:10,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592897203] [2021-03-26 00:16:10,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:16:10,738 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:16:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:16:10,816 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:16:10,859 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:16:10,859 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:16:10,860 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:16:10,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:16:10 BasicIcfg [2021-03-26 00:16:10,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:16:10,984 INFO L168 Benchmark]: Toolchain (without parser) took 28118.57 ms. Allocated memory was 255.9 MB in the beginning and 811.6 MB in the end (delta: 555.7 MB). Free memory was 232.2 MB in the beginning and 638.0 MB in the end (delta: -405.7 MB). Peak memory consumption was 149.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:10,984 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 255.9 MB. Free memory was 237.7 MB in the beginning and 237.5 MB in the end (delta: 168.7 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:16:10,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 570.77 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 232.2 MB in the beginning and 308.8 MB in the end (delta: -76.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:10,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.79 ms. Allocated memory is still 350.2 MB. Free memory was 308.8 MB in the beginning and 306.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:10,986 INFO L168 Benchmark]: Boogie Preprocessor took 39.51 ms. Allocated memory is still 350.2 MB. Free memory was 306.2 MB in the beginning and 304.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:10,989 INFO L168 Benchmark]: RCFGBuilder took 1757.19 ms. Allocated memory is still 350.2 MB. Free memory was 304.1 MB in the beginning and 177.0 MB in the end (delta: 127.0 MB). Peak memory consumption was 132.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:10,989 INFO L168 Benchmark]: TraceAbstraction took 25664.95 ms. Allocated memory was 350.2 MB in the beginning and 811.6 MB in the end (delta: 461.4 MB). Free memory was 177.0 MB in the beginning and 638.0 MB in the end (delta: -460.9 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:16:10,991 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.49 ms. Allocated memory is still 255.9 MB. Free memory was 237.7 MB in the beginning and 237.5 MB in the end (delta: 168.7 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 570.77 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 232.2 MB in the beginning and 308.8 MB in the end (delta: -76.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 78.79 ms. Allocated memory is still 350.2 MB. Free memory was 308.8 MB in the beginning and 306.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 39.51 ms. Allocated memory is still 350.2 MB. Free memory was 306.2 MB in the beginning and 304.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1757.19 ms. Allocated memory is still 350.2 MB. Free memory was 304.1 MB in the beginning and 177.0 MB in the end (delta: 127.0 MB). Peak memory consumption was 132.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 25664.95 ms. Allocated memory was 350.2 MB in the beginning and 811.6 MB in the end (delta: 461.4 MB). Free memory was 177.0 MB in the beginning and 638.0 MB in the end (delta: -460.9 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3274.5ms, 128 PlacesBefore, 61 PlacesAfterwards, 117 TransitionsBefore, 49 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 5389 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2865, positive: 2751, positive conditional: 2751, positive unconditional: 0, negative: 114, negative conditional: 114, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1989, positive: 1938, positive conditional: 0, positive unconditional: 1938, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1989, positive: 1938, positive conditional: 0, positive unconditional: 1938, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1989, positive: 1933, positive conditional: 0, positive unconditional: 1933, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 610, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 594, negative conditional: 0, negative unconditional: 594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2865, positive: 813, positive conditional: 813, positive unconditional: 0, negative: 63, negative conditional: 63, negative unconditional: 0, unknown: 1989, unknown conditional: 1989, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 165, Positive conditional cache size: 165, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1692.6ms, 57 PlacesBefore, 43 PlacesAfterwards, 46 TransitionsBefore, 32 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 4 FixpointIterations, 10 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 2683 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 903, positive: 778, positive conditional: 778, positive unconditional: 0, negative: 125, negative conditional: 125, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, positive: 167, positive conditional: 19, positive unconditional: 148, negative: 39, negative conditional: 10, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 206, positive: 167, positive conditional: 19, positive unconditional: 148, negative: 39, negative conditional: 10, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 206, positive: 153, positive conditional: 0, positive unconditional: 153, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 39, negative conditional: 10, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 622, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 572, negative conditional: 229, negative unconditional: 342, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 903, positive: 611, positive conditional: 611, positive unconditional: 0, negative: 86, negative conditional: 86, negative unconditional: 0, unknown: 206, unknown conditional: 206, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 281, Positive cache size: 231, Positive conditional cache size: 231, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1492.7ms, 46 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 27 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1444 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 563, positive: 484, positive conditional: 484, positive unconditional: 0, negative: 79, negative conditional: 79, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 57, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 57, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 176, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 176, negative conditional: 0, negative unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 563, positive: 441, positive conditional: 441, positive unconditional: 0, negative: 65, negative conditional: 65, negative unconditional: 0, unknown: 57, unknown conditional: 57, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 211, Positive conditional cache size: 211, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.5ms, 44 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 422 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 101, positive conditional: 101, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, positive: 48, positive conditional: 25, positive unconditional: 23, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, positive: 48, positive conditional: 25, positive unconditional: 23, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 50, positive: 48, positive conditional: 0, positive unconditional: 48, 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: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 50, unknown conditional: 50, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 321, Positive cache size: 259, Positive conditional cache size: 259, Positive unconditional cache size: 0, Negative cache size: 62, Negative conditional cache size: 62, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 68.4ms, 48 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 503 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 122, positive: 101, positive conditional: 101, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, positive: 57, positive conditional: 18, positive unconditional: 39, 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: 58, positive: 57, positive conditional: 18, positive unconditional: 39, 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: 58, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 58, unknown conditional: 58, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 379, Positive cache size: 316, Positive conditional cache size: 316, Positive unconditional cache size: 0, Negative cache size: 63, Negative conditional cache size: 63, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.6ms, 51 PlacesBefore, 49 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 613 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 153, positive: 128, positive conditional: 128, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 62, positive conditional: 61, 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: 62, positive: 62, positive conditional: 61, 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: 62, positive: 62, positive conditional: 0, positive unconditional: 62, 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: 66, positive conditional: 66, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 62, unknown conditional: 62, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 441, Positive cache size: 378, Positive conditional cache size: 378, Positive unconditional cache size: 0, Negative cache size: 63, Negative conditional cache size: 63, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 314.5ms, 52 PlacesBefore, 52 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 608 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1118 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 286, positive: 243, positive conditional: 243, positive unconditional: 0, negative: 43, negative conditional: 43, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, positive: 74, positive conditional: 42, positive unconditional: 32, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 85, positive: 74, positive conditional: 42, positive unconditional: 32, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 85, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 216, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 216, negative conditional: 4, negative unconditional: 212, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 286, positive: 169, positive conditional: 169, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 85, unknown conditional: 85, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 452, Positive cache size: 384, Positive conditional cache size: 384, Positive unconditional cache size: 0, Negative cache size: 68, Negative conditional cache size: 68, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 996.0ms, 61 PlacesBefore, 57 PlacesAfterwards, 48 TransitionsBefore, 45 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1297 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 351, positive: 294, positive conditional: 294, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 36, positive conditional: 36, 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: 36, positive: 36, positive conditional: 36, 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: 36, positive: 36, positive conditional: 0, positive unconditional: 36, 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: 351, positive: 258, positive conditional: 258, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 36, unknown conditional: 36, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 417, Positive cache size: 370, Positive conditional cache size: 370, Positive unconditional cache size: 0, Negative cache size: 47, Negative conditional cache size: 47, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 118.0ms, 56 PlacesBefore, 56 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 596 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 559 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 2, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 2, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 428, Positive cache size: 378, Positive conditional cache size: 378, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 584.4ms, 72 PlacesBefore, 72 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 926 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: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 328, Positive conditional cache size: 328, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 217.8ms, 76 PlacesBefore, 72 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 570 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): 376, Positive cache size: 328, Positive conditional cache size: 328, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 184.4ms, 75 PlacesBefore, 73 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 632 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): 376, Positive cache size: 328, Positive conditional cache size: 328, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5075.1ms, 80 PlacesBefore, 78 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 15 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 15, 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: 15, positive: 15, positive conditional: 11, 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: 15, positive: 15, positive conditional: 11, 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: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 306, Positive conditional cache size: 306, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5068.7ms, 81 PlacesBefore, 81 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 664 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 15 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 15, 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: 15, positive: 15, positive conditional: 15, 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): 340, Positive cache size: 306, Positive conditional cache size: 306, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t945; [L874] FCALL, FORK 0 pthread_create(&t945, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t946; [L876] FCALL, FORK 0 pthread_create(&t946, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L877] 0 pthread_t t947; [L878] FCALL, FORK 0 pthread_create(&t947, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L879] 0 pthread_t t948; [L880] FCALL, FORK 0 pthread_create(&t948, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 4 z = 1 [L829] 4 a = 1 [L832] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L840] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L840] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L841] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L841] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L842] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used) [L842] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L844] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4) [L844] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L845] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L851] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L812] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L886] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 120 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 25346.9ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4108.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3383.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 81 SDtfs, 75 SDslu, 100 SDs, 0 SdLazy, 556 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 644.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 534.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred in iteration=13, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 52.6ms SsaConstructionTime, 589.7ms SatisfiabilityAnalysisTime, 965.6ms InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 1766 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...