/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:42:05,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:42:05,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:42:05,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:42:05,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:42:05,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:42:05,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:42:05,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:42:05,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:42:05,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:42:05,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:42:05,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:42:05,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:42:05,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:42:05,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:42:05,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:42:05,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:42:05,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:42:05,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:42:05,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:42:05,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:42:05,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:42:05,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:42:05,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:42:05,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:42:05,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:42:05,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:42:05,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:42:05,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:42:05,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:42:05,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:42:05,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:42:05,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:42:05,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:42:05,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:42:05,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:42:05,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:42:05,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:42:05,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:42:05,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:42:05,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:42:05,422 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:42:05,459 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:42:05,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:42:05,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:42:05,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:42:05,460 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:42:05,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:42:05,460 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:42:05,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:42:05,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:42:05,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:42:05,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:42:05,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:42:05,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:42:05,461 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:42:05,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:42:05,461 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:42:05,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:42:05,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:42:05,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:42:05,462 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:42:05,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:42:05,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:42:05,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:42:05,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:42:05,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:42:05,463 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:42:05,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:42:05,463 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:42:05,463 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:42:05,463 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:42:05,463 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:42:05,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:42:05,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:42:05,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:42:05,699 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:42:05,699 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:42:05,700 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_pso.opt.i [2021-03-26 10:42:05,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa49b6a93/baede19d1aef449aaf9a03319a051a5c/FLAG478eb4f7b [2021-03-26 10:42:06,161 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:42:06,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_pso.opt.i [2021-03-26 10:42:06,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa49b6a93/baede19d1aef449aaf9a03319a051a5c/FLAG478eb4f7b [2021-03-26 10:42:06,188 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa49b6a93/baede19d1aef449aaf9a03319a051a5c [2021-03-26 10:42:06,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:42:06,191 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:42:06,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:42:06,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:42:06,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:42:06,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9110135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06, skipping insertion in model container [2021-03-26 10:42:06,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:42:06,243 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:42:06,380 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/safe032_pso.opt.i[992,1005] [2021-03-26 10:42:06,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:42:06,559 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:42:06,566 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/safe032_pso.opt.i[992,1005] [2021-03-26 10:42:06,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:42:06,637 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:42:06,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06 WrapperNode [2021-03-26 10:42:06,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:42:06,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:42:06,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:42:06,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:42:06,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:42:06,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:42:06,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:42:06,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:42:06,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... [2021-03-26 10:42:06,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:42:06,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:42:06,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:42:06,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:42:06,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:42:06,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:42:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:42:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:42:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:42:06,766 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:42:06,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:42:06,766 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:42:06,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:42:06,767 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:42:06,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:42:06,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:42:06,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:42:06,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:42:06,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:42:06,769 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:42:08,711 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:42:08,711 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:42:08,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:42:08 BoogieIcfgContainer [2021-03-26 10:42:08,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:42:08,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:42:08,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:42:08,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:42:08,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:42:06" (1/3) ... [2021-03-26 10:42:08,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fabb3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:42:08, skipping insertion in model container [2021-03-26 10:42:08,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:06" (2/3) ... [2021-03-26 10:42:08,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fabb3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:42:08, skipping insertion in model container [2021-03-26 10:42:08,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:42:08" (3/3) ... [2021-03-26 10:42:08,719 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_pso.opt.i [2021-03-26 10:42:08,723 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:42:08,726 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:42:08,727 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:42:08,765 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,765 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,765 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,765 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,766 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,766 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,778 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,778 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,778 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,778 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,779 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,797 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,797 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,797 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,797 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,798 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,798 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,798 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,798 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,798 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,798 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,810 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,811 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,815 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,816 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,818 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,818 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,818 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:08,819 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:42:08,831 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:42:08,850 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:42:08,850 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:42:08,850 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:42:08,850 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:42:08,850 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:42:08,850 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:42:08,850 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:42:08,850 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:42:08,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:42:08,892 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:42:08,892 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:08,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:42:08,895 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:42:08,898 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 10:42:08,899 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:08,907 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:42:08,909 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:42:08,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 10:42:08,933 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:42:08,933 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:08,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:42:08,937 INFO L142 LiptonReduction]: Number of co-enabled transitions 1668 [2021-03-26 10:42:09,675 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:42:10,014 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 10:42:10,136 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:42:11,474 WARN L205 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-26 10:42:11,730 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:42:12,971 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:42:13,497 WARN L205 SmtUtils]: Spent 524.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:42:14,162 INFO L154 LiptonReduction]: Checked pairs total: 3146 [2021-03-26 10:42:14,162 INFO L156 LiptonReduction]: Total number of compositions: 65 [2021-03-26 10:42:14,163 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5265 [2021-03-26 10:42:14,173 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 10:42:14,173 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:14,173 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:14,174 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:14,174 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:14,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:14,178 INFO L82 PathProgramCache]: Analyzing trace with hash -281805230, now seen corresponding path program 1 times [2021-03-26 10:42:14,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:14,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868750728] [2021-03-26 10:42:14,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:14,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:14,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:14,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:14,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:14,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868750728] [2021-03-26 10:42:14,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:14,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:42:14,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131571511] [2021-03-26 10:42:14,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:42:14,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:14,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:42:14,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:42:14,375 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 162 [2021-03-26 10:42:14,377 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:14,377 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:14,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 162 [2021-03-26 10:42:14,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:14,495 INFO L129 PetriNetUnfolder]: 115/301 cut-off events. [2021-03-26 10:42:14,495 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:14,496 INFO L84 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 301 events. 115/301 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1513 event pairs, 39 based on Foata normal form. 22/293 useless extension candidates. Maximal degree in co-relation 479. Up to 141 conditions per place. [2021-03-26 10:42:14,498 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 13 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2021-03-26 10:42:14,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 121 flow [2021-03-26 10:42:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:42:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:42:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2021-03-26 10:42:14,512 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8827160493827161 [2021-03-26 10:42:14,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2021-03-26 10:42:14,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2021-03-26 10:42:14,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:14,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2021-03-26 10:42:14,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:14,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:14,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:14,526 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 429 transitions. [2021-03-26 10:42:14,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 121 flow [2021-03-26 10:42:14,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:42:14,529 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 80 flow [2021-03-26 10:42:14,530 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2021-03-26 10:42:14,530 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 10:42:14,530 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:14,531 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-26 10:42:14,531 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-26 10:42:14,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2021-03-26 10:42:14,540 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-26 10:42:14,540 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:14,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:42:14,540 INFO L142 LiptonReduction]: Number of co-enabled transitions 306 [2021-03-26 10:42:14,906 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:42:15,138 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:42:15,668 WARN L205 SmtUtils]: Spent 527.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:42:16,176 WARN L205 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:42:16,673 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:42:16,777 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:42:17,052 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-26 10:42:17,304 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-26 10:42:18,029 WARN L205 SmtUtils]: Spent 723.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-26 10:42:18,784 WARN L205 SmtUtils]: Spent 748.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-26 10:42:19,098 INFO L154 LiptonReduction]: Checked pairs total: 1174 [2021-03-26 10:42:19,098 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 10:42:19,098 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4568 [2021-03-26 10:42:19,099 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 10:42:19,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:19,099 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:19,099 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] [2021-03-26 10:42:19,100 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:42:19,100 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:19,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:19,100 INFO L82 PathProgramCache]: Analyzing trace with hash 557731296, now seen corresponding path program 1 times [2021-03-26 10:42:19,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:19,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742529758] [2021-03-26 10:42:19,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:19,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:19,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:19,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:19,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:19,204 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:42:19,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:42:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:19,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742529758] [2021-03-26 10:42:19,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:19,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:42:19,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626671298] [2021-03-26 10:42:19,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:42:19,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:19,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:42:19,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:42:19,210 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 174 [2021-03-26 10:42:19,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:19,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:19,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 174 [2021-03-26 10:42:19,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:19,244 INFO L129 PetriNetUnfolder]: 7/41 cut-off events. [2021-03-26 10:42:19,244 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:42:19,244 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 41 events. 7/41 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 95 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 59. Up to 10 conditions per place. [2021-03-26 10:42:19,244 INFO L132 encePairwiseOnDemand]: 169/174 looper letters, 3 selfloop transitions, 3 changer transitions 6/31 dead transitions. [2021-03-26 10:42:19,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 96 flow [2021-03-26 10:42:19,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:42:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:42:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 743 transitions. [2021-03-26 10:42:19,246 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8540229885057471 [2021-03-26 10:42:19,246 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 743 transitions. [2021-03-26 10:42:19,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 743 transitions. [2021-03-26 10:42:19,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:19,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 743 transitions. [2021-03-26 10:42:19,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:19,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:19,249 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:19,249 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 743 transitions. [2021-03-26 10:42:19,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 96 flow [2021-03-26 10:42:19,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:42:19,250 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 75 flow [2021-03-26 10:42:19,250 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2021-03-26 10:42:19,251 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -10 predicate places. [2021-03-26 10:42:19,251 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:19,251 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 75 flow [2021-03-26 10:42:19,251 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 75 flow [2021-03-26 10:42:19,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 75 flow [2021-03-26 10:42:19,256 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-26 10:42:19,256 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 10:42:19,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 33 events. 3/33 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-03-26 10:42:19,258 INFO L142 LiptonReduction]: Number of co-enabled transitions 232 [2021-03-26 10:42:19,705 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:42:19,819 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:42:20,049 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:42:20,155 INFO L154 LiptonReduction]: Checked pairs total: 753 [2021-03-26 10:42:20,155 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:42:20,156 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 905 [2021-03-26 10:42:20,156 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 71 flow [2021-03-26 10:42:20,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,157 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:20,157 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:20,157 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:42:20,157 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:20,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:20,157 INFO L82 PathProgramCache]: Analyzing trace with hash -93592942, now seen corresponding path program 1 times [2021-03-26 10:42:20,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:20,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366468383] [2021-03-26 10:42:20,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:20,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:20,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:20,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:20,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:20,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:20,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366468383] [2021-03-26 10:42:20,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:20,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:42:20,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580464746] [2021-03-26 10:42:20,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:42:20,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:20,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:42:20,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:42:20,209 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 176 [2021-03-26 10:42:20,210 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,210 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:20,210 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 176 [2021-03-26 10:42:20,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:20,223 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 10:42:20,223 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-03-26 10:42:20,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 31 events. 3/31 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 62 event pairs, 1 based on Foata normal form. 2/32 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-03-26 10:42:20,224 INFO L132 encePairwiseOnDemand]: 173/176 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-26 10:42:20,224 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 77 flow [2021-03-26 10:42:20,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:42:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:42:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-03-26 10:42:20,225 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8882575757575758 [2021-03-26 10:42:20,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-03-26 10:42:20,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-03-26 10:42:20,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:20,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-03-26 10:42:20,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,227 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 71 flow. Second operand 3 states and 469 transitions. [2021-03-26 10:42:20,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 77 flow [2021-03-26 10:42:20,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 70 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 10:42:20,229 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 72 flow [2021-03-26 10:42:20,229 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-03-26 10:42:20,229 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -14 predicate places. [2021-03-26 10:42:20,229 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:20,229 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-26 10:42:20,229 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-26 10:42:20,230 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 72 flow [2021-03-26 10:42:20,233 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 10:42:20,234 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 10:42:20,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-26 10:42:20,234 INFO L142 LiptonReduction]: Number of co-enabled transitions 226 [2021-03-26 10:42:20,235 INFO L154 LiptonReduction]: Checked pairs total: 233 [2021-03-26 10:42:20,235 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:20,235 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-03-26 10:42:20,237 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 72 flow [2021-03-26 10:42:20,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,237 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:20,237 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:20,237 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:42:20,238 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:20,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:20,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1386441617, now seen corresponding path program 1 times [2021-03-26 10:42:20,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:20,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827730219] [2021-03-26 10:42:20,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:20,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:20,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:20,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:20,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:20,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:20,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:42:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:20,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827730219] [2021-03-26 10:42:20,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:20,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:42:20,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576811182] [2021-03-26 10:42:20,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:42:20,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:20,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:42:20,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:42:20,408 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-26 10:42:20,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:20,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-26 10:42:20,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:20,529 INFO L129 PetriNetUnfolder]: 155/320 cut-off events. [2021-03-26 10:42:20,529 INFO L130 PetriNetUnfolder]: For 76/77 co-relation queries the response was YES. [2021-03-26 10:42:20,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 320 events. 155/320 cut-off events. For 76/77 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1534 event pairs, 21 based on Foata normal form. 7/319 useless extension candidates. Maximal degree in co-relation 668. Up to 180 conditions per place. [2021-03-26 10:42:20,532 INFO L132 encePairwiseOnDemand]: 168/176 looper letters, 16 selfloop transitions, 11 changer transitions 0/40 dead transitions. [2021-03-26 10:42:20,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 40 transitions, 167 flow [2021-03-26 10:42:20,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:42:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:42:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2021-03-26 10:42:20,535 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7431818181818182 [2021-03-26 10:42:20,535 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2021-03-26 10:42:20,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2021-03-26 10:42:20,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:20,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2021-03-26 10:42:20,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,538 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,538 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 72 flow. Second operand 5 states and 654 transitions. [2021-03-26 10:42:20,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 40 transitions, 167 flow [2021-03-26 10:42:20,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:42:20,540 INFO L241 Difference]: Finished difference. Result has 38 places, 32 transitions, 145 flow [2021-03-26 10:42:20,540 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2021-03-26 10:42:20,541 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -9 predicate places. [2021-03-26 10:42:20,541 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:20,541 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 32 transitions, 145 flow [2021-03-26 10:42:20,541 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 32 transitions, 145 flow [2021-03-26 10:42:20,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 145 flow [2021-03-26 10:42:20,563 INFO L129 PetriNetUnfolder]: 62/153 cut-off events. [2021-03-26 10:42:20,563 INFO L130 PetriNetUnfolder]: For 147/168 co-relation queries the response was YES. [2021-03-26 10:42:20,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 153 events. 62/153 cut-off events. For 147/168 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 681 event pairs, 29 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 407. Up to 84 conditions per place. [2021-03-26 10:42:20,565 INFO L142 LiptonReduction]: Number of co-enabled transitions 290 [2021-03-26 10:42:20,651 INFO L154 LiptonReduction]: Checked pairs total: 146 [2021-03-26 10:42:20,651 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:20,651 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 110 [2021-03-26 10:42:20,652 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 145 flow [2021-03-26 10:42:20,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,653 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:20,653 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:20,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:42:20,653 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:20,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:20,653 INFO L82 PathProgramCache]: Analyzing trace with hash -554126301, now seen corresponding path program 1 times [2021-03-26 10:42:20,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:20,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438697661] [2021-03-26 10:42:20,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:20,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:20,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:20,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:20,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:42:20,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:20,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:42:20,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:20,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:42:20,806 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.1 percent of original size [2021-03-26 10:42:20,807 INFO L147 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size 23 [2021-03-26 10:42:20,829 INFO L142 QuantifierPusher]: treesize reduction 4, result has 91.1 percent of original size [2021-03-26 10:42:20,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 10:42:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:20,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438697661] [2021-03-26 10:42:20,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:20,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:42:20,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310209486] [2021-03-26 10:42:20,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:42:20,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:20,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:42:20,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:42:20,858 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 176 [2021-03-26 10:42:20,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 145 flow. Second operand has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:20,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 176 [2021-03-26 10:42:20,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:21,033 INFO L129 PetriNetUnfolder]: 153/313 cut-off events. [2021-03-26 10:42:21,033 INFO L130 PetriNetUnfolder]: For 308/320 co-relation queries the response was YES. [2021-03-26 10:42:21,034 INFO L84 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 313 events. 153/313 cut-off events. For 308/320 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1470 event pairs, 19 based on Foata normal form. 5/309 useless extension candidates. Maximal degree in co-relation 951. Up to 190 conditions per place. [2021-03-26 10:42:21,036 INFO L132 encePairwiseOnDemand]: 168/176 looper letters, 20 selfloop transitions, 16 changer transitions 0/49 dead transitions. [2021-03-26 10:42:21,036 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 297 flow [2021-03-26 10:42:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:42:21,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:42:21,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2021-03-26 10:42:21,038 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7636363636363637 [2021-03-26 10:42:21,038 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2021-03-26 10:42:21,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2021-03-26 10:42:21,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:21,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2021-03-26 10:42:21,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,042 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,042 INFO L185 Difference]: Start difference. First operand has 38 places, 32 transitions, 145 flow. Second operand 5 states and 672 transitions. [2021-03-26 10:42:21,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 297 flow [2021-03-26 10:42:21,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:42:21,046 INFO L241 Difference]: Finished difference. Result has 44 places, 43 transitions, 263 flow [2021-03-26 10:42:21,046 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2021-03-26 10:42:21,046 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 10:42:21,046 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:21,046 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 43 transitions, 263 flow [2021-03-26 10:42:21,046 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 43 transitions, 263 flow [2021-03-26 10:42:21,046 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 263 flow [2021-03-26 10:42:21,077 INFO L129 PetriNetUnfolder]: 107/249 cut-off events. [2021-03-26 10:42:21,078 INFO L130 PetriNetUnfolder]: For 372/386 co-relation queries the response was YES. [2021-03-26 10:42:21,078 INFO L84 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 249 events. 107/249 cut-off events. For 372/386 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1254 event pairs, 23 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 756. Up to 113 conditions per place. [2021-03-26 10:42:21,080 INFO L142 LiptonReduction]: Number of co-enabled transitions 324 [2021-03-26 10:42:21,122 INFO L154 LiptonReduction]: Checked pairs total: 111 [2021-03-26 10:42:21,122 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:21,122 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76 [2021-03-26 10:42:21,126 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 263 flow [2021-03-26 10:42:21,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,127 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:21,127 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:21,127 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:42:21,127 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:21,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:21,127 INFO L82 PathProgramCache]: Analyzing trace with hash 534790203, now seen corresponding path program 1 times [2021-03-26 10:42:21,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:21,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611643114] [2021-03-26 10:42:21,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:21,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:21,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:21,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:21,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:21,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:21,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:21,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:21,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:42:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:21,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611643114] [2021-03-26 10:42:21,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:21,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:42:21,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915693592] [2021-03-26 10:42:21,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:42:21,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:21,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:42:21,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:42:21,255 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-26 10:42:21,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:21,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-26 10:42:21,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:21,390 INFO L129 PetriNetUnfolder]: 165/346 cut-off events. [2021-03-26 10:42:21,390 INFO L130 PetriNetUnfolder]: For 729/771 co-relation queries the response was YES. [2021-03-26 10:42:21,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 346 events. 165/346 cut-off events. For 729/771 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1708 event pairs, 12 based on Foata normal form. 11/354 useless extension candidates. Maximal degree in co-relation 1249. Up to 178 conditions per place. [2021-03-26 10:42:21,392 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 29 selfloop transitions, 22 changer transitions 0/64 dead transitions. [2021-03-26 10:42:21,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 491 flow [2021-03-26 10:42:21,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:42:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:42:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions. [2021-03-26 10:42:21,395 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7367424242424242 [2021-03-26 10:42:21,395 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 778 transitions. [2021-03-26 10:42:21,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions. [2021-03-26 10:42:21,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:21,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions. [2021-03-26 10:42:21,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,398 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,398 INFO L185 Difference]: Start difference. First operand has 44 places, 43 transitions, 263 flow. Second operand 6 states and 778 transitions. [2021-03-26 10:42:21,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 491 flow [2021-03-26 10:42:21,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 487 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-26 10:42:21,401 INFO L241 Difference]: Finished difference. Result has 51 places, 57 transitions, 430 flow [2021-03-26 10:42:21,401 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=430, PETRI_PLACES=51, PETRI_TRANSITIONS=57} [2021-03-26 10:42:21,401 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2021-03-26 10:42:21,402 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:21,402 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 57 transitions, 430 flow [2021-03-26 10:42:21,402 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 57 transitions, 430 flow [2021-03-26 10:42:21,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 57 transitions, 430 flow [2021-03-26 10:42:21,434 INFO L129 PetriNetUnfolder]: 133/294 cut-off events. [2021-03-26 10:42:21,434 INFO L130 PetriNetUnfolder]: For 811/872 co-relation queries the response was YES. [2021-03-26 10:42:21,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 294 events. 133/294 cut-off events. For 811/872 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1480 event pairs, 22 based on Foata normal form. 15/285 useless extension candidates. Maximal degree in co-relation 1147. Up to 136 conditions per place. [2021-03-26 10:42:21,437 INFO L142 LiptonReduction]: Number of co-enabled transitions 392 [2021-03-26 10:42:21,448 INFO L154 LiptonReduction]: Checked pairs total: 202 [2021-03-26 10:42:21,448 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:21,448 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 46 [2021-03-26 10:42:21,449 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 57 transitions, 430 flow [2021-03-26 10:42:21,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,450 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:21,450 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:21,450 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:42:21,450 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:21,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:21,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1938055883, now seen corresponding path program 1 times [2021-03-26 10:42:21,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:21,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196079973] [2021-03-26 10:42:21,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:21,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:21,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:42:21,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:21,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:42:21,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:21,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:21,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:21,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:42:21,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:21,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:42:21,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:21,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:42:21,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:21,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:42:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:21,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196079973] [2021-03-26 10:42:21,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:21,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 10:42:21,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804316230] [2021-03-26 10:42:21,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 10:42:21,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:21,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 10:42:21,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-03-26 10:42:21,615 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 176 [2021-03-26 10:42:21,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 57 transitions, 430 flow. Second operand has 9 states, 9 states have (on average 120.88888888888889) internal successors, (1088), 9 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:21,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 176 [2021-03-26 10:42:21,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:21,870 INFO L129 PetriNetUnfolder]: 205/427 cut-off events. [2021-03-26 10:42:21,871 INFO L130 PetriNetUnfolder]: For 1220/1280 co-relation queries the response was YES. [2021-03-26 10:42:21,872 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 427 events. 205/427 cut-off events. For 1220/1280 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2351 event pairs, 8 based on Foata normal form. 35/449 useless extension candidates. Maximal degree in co-relation 1847. Up to 211 conditions per place. [2021-03-26 10:42:21,874 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 34 selfloop transitions, 37 changer transitions 0/84 dead transitions. [2021-03-26 10:42:21,874 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 794 flow [2021-03-26 10:42:21,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:42:21,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:42:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 878 transitions. [2021-03-26 10:42:21,876 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7126623376623377 [2021-03-26 10:42:21,876 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 878 transitions. [2021-03-26 10:42:21,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 878 transitions. [2021-03-26 10:42:21,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:21,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 878 transitions. [2021-03-26 10:42:21,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,879 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,879 INFO L185 Difference]: Start difference. First operand has 51 places, 57 transitions, 430 flow. Second operand 7 states and 878 transitions. [2021-03-26 10:42:21,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 794 flow [2021-03-26 10:42:21,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 84 transitions, 743 flow, removed 12 selfloop flow, removed 3 redundant places. [2021-03-26 10:42:21,885 INFO L241 Difference]: Finished difference. Result has 57 places, 75 transitions, 675 flow [2021-03-26 10:42:21,885 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=675, PETRI_PLACES=57, PETRI_TRANSITIONS=75} [2021-03-26 10:42:21,885 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2021-03-26 10:42:21,885 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:21,885 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 75 transitions, 675 flow [2021-03-26 10:42:21,885 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 75 transitions, 675 flow [2021-03-26 10:42:21,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 75 transitions, 675 flow [2021-03-26 10:42:21,927 INFO L129 PetriNetUnfolder]: 168/389 cut-off events. [2021-03-26 10:42:21,927 INFO L130 PetriNetUnfolder]: For 1342/1412 co-relation queries the response was YES. [2021-03-26 10:42:21,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 389 events. 168/389 cut-off events. For 1342/1412 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2211 event pairs, 5 based on Foata normal form. 15/392 useless extension candidates. Maximal degree in co-relation 1661. Up to 179 conditions per place. [2021-03-26 10:42:21,930 INFO L142 LiptonReduction]: Number of co-enabled transitions 516 [2021-03-26 10:42:23,218 WARN L205 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-26 10:42:23,568 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2021-03-26 10:42:25,580 WARN L205 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-26 10:42:26,362 WARN L205 SmtUtils]: Spent 780.00 ms on a formula simplification that was a NOOP. DAG size: 305 [2021-03-26 10:42:26,407 INFO L154 LiptonReduction]: Checked pairs total: 835 [2021-03-26 10:42:26,407 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:42:26,407 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4522 [2021-03-26 10:42:26,407 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 75 transitions, 679 flow [2021-03-26 10:42:26,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 120.88888888888889) internal successors, (1088), 9 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:26,408 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:26,408 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:26,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:42:26,408 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:26,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2036748947, now seen corresponding path program 1 times [2021-03-26 10:42:26,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:26,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519183475] [2021-03-26 10:42:26,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:26,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:26,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:26,473 INFO L142 QuantifierPusher]: treesize reduction 37, result has 43.9 percent of original size [2021-03-26 10:42:26,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 10:42:26,477 INFO L142 QuantifierPusher]: treesize reduction 37, result has 43.9 percent of original size [2021-03-26 10:42:26,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 10:42:26,482 INFO L142 QuantifierPusher]: treesize reduction 38, result has 62.7 percent of original size [2021-03-26 10:42:26,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-03-26 10:42:26,514 INFO L142 QuantifierPusher]: treesize reduction 26, result has 64.9 percent of original size [2021-03-26 10:42:26,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 10:42:26,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:26,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 10:42:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:26,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519183475] [2021-03-26 10:42:26,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:26,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:42:26,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761360632] [2021-03-26 10:42:26,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:42:26,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:26,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:42:26,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:42:26,561 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 177 [2021-03-26 10:42:26,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 75 transitions, 679 flow. Second operand has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:26,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:26,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 177 [2021-03-26 10:42:26,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:26,833 INFO L129 PetriNetUnfolder]: 210/447 cut-off events. [2021-03-26 10:42:26,834 INFO L130 PetriNetUnfolder]: For 2045/2149 co-relation queries the response was YES. [2021-03-26 10:42:26,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2222 conditions, 447 events. 210/447 cut-off events. For 2045/2149 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2515 event pairs, 14 based on Foata normal form. 46/482 useless extension candidates. Maximal degree in co-relation 2197. Up to 245 conditions per place. [2021-03-26 10:42:26,837 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 42 selfloop transitions, 31 changer transitions 2/88 dead transitions. [2021-03-26 10:42:26,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 946 flow [2021-03-26 10:42:26,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:42:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:42:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2021-03-26 10:42:26,840 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7062146892655368 [2021-03-26 10:42:26,840 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2021-03-26 10:42:26,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2021-03-26 10:42:26,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:26,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2021-03-26 10:42:26,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:26,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 177.0) internal successors, (1593), 9 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:26,843 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 177.0) internal successors, (1593), 9 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:26,843 INFO L185 Difference]: Start difference. First operand has 57 places, 75 transitions, 679 flow. Second operand 8 states and 1000 transitions. [2021-03-26 10:42:26,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 946 flow [2021-03-26 10:42:26,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 916 flow, removed 15 selfloop flow, removed 0 redundant places. [2021-03-26 10:42:26,850 INFO L241 Difference]: Finished difference. Result has 66 places, 78 transitions, 770 flow [2021-03-26 10:42:26,850 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=770, PETRI_PLACES=66, PETRI_TRANSITIONS=78} [2021-03-26 10:42:26,850 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2021-03-26 10:42:26,850 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:26,850 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 78 transitions, 770 flow [2021-03-26 10:42:26,851 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 78 transitions, 770 flow [2021-03-26 10:42:26,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 78 transitions, 770 flow [2021-03-26 10:42:26,895 INFO L129 PetriNetUnfolder]: 163/405 cut-off events. [2021-03-26 10:42:26,895 INFO L130 PetriNetUnfolder]: For 2002/2131 co-relation queries the response was YES. [2021-03-26 10:42:26,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 405 events. 163/405 cut-off events. For 2002/2131 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2446 event pairs, 8 based on Foata normal form. 23/419 useless extension candidates. Maximal degree in co-relation 1854. Up to 171 conditions per place. [2021-03-26 10:42:26,899 INFO L142 LiptonReduction]: Number of co-enabled transitions 542 [2021-03-26 10:42:26,936 INFO L154 LiptonReduction]: Checked pairs total: 484 [2021-03-26 10:42:26,936 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:26,936 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 86 [2021-03-26 10:42:26,936 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 78 transitions, 770 flow [2021-03-26 10:42:26,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:26,937 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:26,937 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:26,937 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:42:26,937 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:26,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:26,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1992956177, now seen corresponding path program 2 times [2021-03-26 10:42:26,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:26,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920917815] [2021-03-26 10:42:26,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:27,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:42:27,014 INFO L142 QuantifierPusher]: treesize reduction 32, result has 69.5 percent of original size [2021-03-26 10:42:27,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 73 [2021-03-26 10:42:27,023 INFO L142 QuantifierPusher]: treesize reduction 32, result has 69.5 percent of original size [2021-03-26 10:42:27,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 73 [2021-03-26 10:42:27,029 INFO L142 QuantifierPusher]: treesize reduction 26, result has 61.8 percent of original size [2021-03-26 10:42:27,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 10:42:27,059 INFO L142 QuantifierPusher]: treesize reduction 26, result has 63.4 percent of original size [2021-03-26 10:42:27,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 10:42:27,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:42:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:27,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920917815] [2021-03-26 10:42:27,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:27,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:42:27,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403716606] [2021-03-26 10:42:27,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:42:27,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:27,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:42:27,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:42:27,101 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 177 [2021-03-26 10:42:27,103 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 78 transitions, 770 flow. Second operand has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,103 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:27,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 177 [2021-03-26 10:42:27,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:27,330 INFO L129 PetriNetUnfolder]: 220/482 cut-off events. [2021-03-26 10:42:27,330 INFO L130 PetriNetUnfolder]: For 2735/2886 co-relation queries the response was YES. [2021-03-26 10:42:27,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2516 conditions, 482 events. 220/482 cut-off events. For 2735/2886 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2826 event pairs, 9 based on Foata normal form. 51/524 useless extension candidates. Maximal degree in co-relation 2487. Up to 287 conditions per place. [2021-03-26 10:42:27,334 INFO L132 encePairwiseOnDemand]: 168/177 looper letters, 51 selfloop transitions, 34 changer transitions 0/98 dead transitions. [2021-03-26 10:42:27,334 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 98 transitions, 1128 flow [2021-03-26 10:42:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:42:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:42:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1005 transitions. [2021-03-26 10:42:27,337 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7097457627118644 [2021-03-26 10:42:27,337 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1005 transitions. [2021-03-26 10:42:27,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1005 transitions. [2021-03-26 10:42:27,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:27,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1005 transitions. [2021-03-26 10:42:27,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.625) internal successors, (1005), 8 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 177.0) internal successors, (1593), 9 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,341 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 177.0) internal successors, (1593), 9 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,341 INFO L185 Difference]: Start difference. First operand has 66 places, 78 transitions, 770 flow. Second operand 8 states and 1005 transitions. [2021-03-26 10:42:27,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 98 transitions, 1128 flow [2021-03-26 10:42:27,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 98 transitions, 1092 flow, removed 7 selfloop flow, removed 3 redundant places. [2021-03-26 10:42:27,350 INFO L241 Difference]: Finished difference. Result has 73 places, 90 transitions, 969 flow [2021-03-26 10:42:27,350 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=969, PETRI_PLACES=73, PETRI_TRANSITIONS=90} [2021-03-26 10:42:27,350 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 26 predicate places. [2021-03-26 10:42:27,350 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:27,350 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 90 transitions, 969 flow [2021-03-26 10:42:27,350 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 90 transitions, 969 flow [2021-03-26 10:42:27,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 90 transitions, 969 flow [2021-03-26 10:42:27,434 INFO L129 PetriNetUnfolder]: 177/413 cut-off events. [2021-03-26 10:42:27,434 INFO L130 PetriNetUnfolder]: For 3131/3319 co-relation queries the response was YES. [2021-03-26 10:42:27,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2143 conditions, 413 events. 177/413 cut-off events. For 3131/3319 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2436 event pairs, 17 based on Foata normal form. 63/463 useless extension candidates. Maximal degree in co-relation 2113. Up to 176 conditions per place. [2021-03-26 10:42:27,439 INFO L142 LiptonReduction]: Number of co-enabled transitions 616 [2021-03-26 10:42:27,463 INFO L154 LiptonReduction]: Checked pairs total: 836 [2021-03-26 10:42:27,463 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:27,463 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 113 [2021-03-26 10:42:27,463 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 90 transitions, 969 flow [2021-03-26 10:42:27,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,464 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:27,464 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:27,464 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:42:27,464 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:27,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:27,465 INFO L82 PathProgramCache]: Analyzing trace with hash -796955053, now seen corresponding path program 1 times [2021-03-26 10:42:27,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:27,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320915662] [2021-03-26 10:42:27,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:27,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:27,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:27,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:27,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:27,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:27,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320915662] [2021-03-26 10:42:27,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:27,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:42:27,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868565126] [2021-03-26 10:42:27,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:42:27,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:27,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:42:27,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:42:27,551 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 177 [2021-03-26 10:42:27,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 90 transitions, 969 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:27,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 177 [2021-03-26 10:42:27,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:27,768 INFO L129 PetriNetUnfolder]: 251/587 cut-off events. [2021-03-26 10:42:27,769 INFO L130 PetriNetUnfolder]: For 4118/4291 co-relation queries the response was YES. [2021-03-26 10:42:27,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3289 conditions, 587 events. 251/587 cut-off events. For 4118/4291 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3739 event pairs, 7 based on Foata normal form. 38/615 useless extension candidates. Maximal degree in co-relation 3257. Up to 318 conditions per place. [2021-03-26 10:42:27,774 INFO L132 encePairwiseOnDemand]: 166/177 looper letters, 49 selfloop transitions, 61 changer transitions 2/125 dead transitions. [2021-03-26 10:42:27,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 125 transitions, 1598 flow [2021-03-26 10:42:27,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:42:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:42:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 783 transitions. [2021-03-26 10:42:27,776 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7372881355932204 [2021-03-26 10:42:27,776 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 783 transitions. [2021-03-26 10:42:27,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 783 transitions. [2021-03-26 10:42:27,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:27,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 783 transitions. [2021-03-26 10:42:27,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,779 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,779 INFO L185 Difference]: Start difference. First operand has 73 places, 90 transitions, 969 flow. Second operand 6 states and 783 transitions. [2021-03-26 10:42:27,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 125 transitions, 1598 flow [2021-03-26 10:42:27,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 125 transitions, 1505 flow, removed 20 selfloop flow, removed 4 redundant places. [2021-03-26 10:42:27,792 INFO L241 Difference]: Finished difference. Result has 78 places, 120 transitions, 1523 flow [2021-03-26 10:42:27,792 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1523, PETRI_PLACES=78, PETRI_TRANSITIONS=120} [2021-03-26 10:42:27,792 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 31 predicate places. [2021-03-26 10:42:27,792 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:27,792 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 120 transitions, 1523 flow [2021-03-26 10:42:27,792 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 120 transitions, 1523 flow [2021-03-26 10:42:27,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 120 transitions, 1523 flow [2021-03-26 10:42:27,859 INFO L129 PetriNetUnfolder]: 237/567 cut-off events. [2021-03-26 10:42:27,859 INFO L130 PetriNetUnfolder]: For 4914/5062 co-relation queries the response was YES. [2021-03-26 10:42:27,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3251 conditions, 567 events. 237/567 cut-off events. For 4914/5062 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3672 event pairs, 9 based on Foata normal form. 38/591 useless extension candidates. Maximal degree in co-relation 3217. Up to 215 conditions per place. [2021-03-26 10:42:27,865 INFO L142 LiptonReduction]: Number of co-enabled transitions 716 [2021-03-26 10:42:28,437 WARN L205 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-26 10:42:28,633 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 10:42:29,846 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 339 DAG size of output: 262 [2021-03-26 10:42:30,287 WARN L205 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-26 10:42:30,370 INFO L154 LiptonReduction]: Checked pairs total: 4837 [2021-03-26 10:42:30,371 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:42:30,371 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2579 [2021-03-26 10:42:30,371 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 119 transitions, 1535 flow [2021-03-26 10:42:30,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:30,372 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:30,372 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:30,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:42:30,372 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:30,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:30,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1602789271, now seen corresponding path program 2 times [2021-03-26 10:42:30,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:30,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417500400] [2021-03-26 10:42:30,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:30,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:30,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:30,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:30,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:30,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:30,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:30,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:30,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:30,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417500400] [2021-03-26 10:42:30,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:30,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:42:30,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421817020] [2021-03-26 10:42:30,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:42:30,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:30,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:42:30,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:42:30,456 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 178 [2021-03-26 10:42:30,456 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 119 transitions, 1535 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:30,456 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:30,456 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 178 [2021-03-26 10:42:30,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:30,604 INFO L129 PetriNetUnfolder]: 244/588 cut-off events. [2021-03-26 10:42:30,605 INFO L130 PetriNetUnfolder]: For 5665/5921 co-relation queries the response was YES. [2021-03-26 10:42:30,607 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 588 events. 244/588 cut-off events. For 5665/5921 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3851 event pairs, 33 based on Foata normal form. 40/619 useless extension candidates. Maximal degree in co-relation 3734. Up to 340 conditions per place. [2021-03-26 10:42:30,609 INFO L132 encePairwiseOnDemand]: 169/178 looper letters, 55 selfloop transitions, 58 changer transitions 2/128 dead transitions. [2021-03-26 10:42:30,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 128 transitions, 1882 flow [2021-03-26 10:42:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:42:30,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:42:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2021-03-26 10:42:30,611 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7598314606741573 [2021-03-26 10:42:30,611 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2021-03-26 10:42:30,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2021-03-26 10:42:30,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:30,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2021-03-26 10:42:30,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:30,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:30,614 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:30,614 INFO L185 Difference]: Start difference. First operand has 78 places, 119 transitions, 1535 flow. Second operand 4 states and 541 transitions. [2021-03-26 10:42:30,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 128 transitions, 1882 flow [2021-03-26 10:42:30,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 128 transitions, 1841 flow, removed 20 selfloop flow, removed 1 redundant places. [2021-03-26 10:42:30,627 INFO L241 Difference]: Finished difference. Result has 81 places, 125 transitions, 1759 flow [2021-03-26 10:42:30,628 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1759, PETRI_PLACES=81, PETRI_TRANSITIONS=125} [2021-03-26 10:42:30,628 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 34 predicate places. [2021-03-26 10:42:30,628 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:30,628 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 125 transitions, 1759 flow [2021-03-26 10:42:30,628 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 125 transitions, 1759 flow [2021-03-26 10:42:30,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 125 transitions, 1759 flow [2021-03-26 10:42:30,699 INFO L129 PetriNetUnfolder]: 229/569 cut-off events. [2021-03-26 10:42:30,699 INFO L130 PetriNetUnfolder]: For 6013/6315 co-relation queries the response was YES. [2021-03-26 10:42:30,701 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3461 conditions, 569 events. 229/569 cut-off events. For 6013/6315 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3796 event pairs, 13 based on Foata normal form. 53/612 useless extension candidates. Maximal degree in co-relation 3425. Up to 218 conditions per place. [2021-03-26 10:42:30,705 INFO L142 LiptonReduction]: Number of co-enabled transitions 740 [2021-03-26 10:42:30,752 INFO L154 LiptonReduction]: Checked pairs total: 2565 [2021-03-26 10:42:30,752 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:30,752 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 124 [2021-03-26 10:42:30,754 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 125 transitions, 1759 flow [2021-03-26 10:42:30,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:30,755 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:30,755 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:30,755 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:42:30,755 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:30,755 INFO L82 PathProgramCache]: Analyzing trace with hash -434358911, now seen corresponding path program 3 times [2021-03-26 10:42:30,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:30,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62574205] [2021-03-26 10:42:30,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:30,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:30,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:42:30,851 INFO L142 QuantifierPusher]: treesize reduction 105, result has 43.2 percent of original size [2021-03-26 10:42:30,854 INFO L147 QuantifierPusher]: treesize reduction 9, result has 88.8 percent of original size 71 [2021-03-26 10:42:30,861 INFO L142 QuantifierPusher]: treesize reduction 33, result has 70.5 percent of original size [2021-03-26 10:42:30,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 79 [2021-03-26 10:42:30,893 INFO L142 QuantifierPusher]: treesize reduction 26, result has 58.7 percent of original size [2021-03-26 10:42:30,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 10:42:30,914 INFO L142 QuantifierPusher]: treesize reduction 26, result has 60.6 percent of original size [2021-03-26 10:42:30,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 10:42:30,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:30,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:42:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:30,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62574205] [2021-03-26 10:42:30,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:30,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:42:30,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466342896] [2021-03-26 10:42:30,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:42:30,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:30,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:42:30,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:42:30,949 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 178 [2021-03-26 10:42:30,949 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 125 transitions, 1759 flow. Second operand has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:30,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:30,949 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 178 [2021-03-26 10:42:30,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:31,192 INFO L129 PetriNetUnfolder]: 238/580 cut-off events. [2021-03-26 10:42:31,193 INFO L130 PetriNetUnfolder]: For 6462/6719 co-relation queries the response was YES. [2021-03-26 10:42:31,195 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3917 conditions, 580 events. 238/580 cut-off events. For 6462/6719 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3839 event pairs, 6 based on Foata normal form. 67/639 useless extension candidates. Maximal degree in co-relation 3879. Up to 339 conditions per place. [2021-03-26 10:42:31,197 INFO L132 encePairwiseOnDemand]: 170/178 looper letters, 73 selfloop transitions, 52 changer transitions 0/138 dead transitions. [2021-03-26 10:42:31,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 138 transitions, 2209 flow [2021-03-26 10:42:31,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:42:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:42:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 893 transitions. [2021-03-26 10:42:31,200 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.71669341894061 [2021-03-26 10:42:31,200 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 893 transitions. [2021-03-26 10:42:31,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 893 transitions. [2021-03-26 10:42:31,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:31,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 893 transitions. [2021-03-26 10:42:31,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:31,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:31,203 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:31,203 INFO L185 Difference]: Start difference. First operand has 81 places, 125 transitions, 1759 flow. Second operand 7 states and 893 transitions. [2021-03-26 10:42:31,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 138 transitions, 2209 flow [2021-03-26 10:42:31,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 138 transitions, 2190 flow, removed 9 selfloop flow, removed 1 redundant places. [2021-03-26 10:42:31,219 INFO L241 Difference]: Finished difference. Result has 89 places, 132 transitions, 2036 flow [2021-03-26 10:42:31,219 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=1742, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2036, PETRI_PLACES=89, PETRI_TRANSITIONS=132} [2021-03-26 10:42:31,219 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 42 predicate places. [2021-03-26 10:42:31,219 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:31,219 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 132 transitions, 2036 flow [2021-03-26 10:42:31,219 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 132 transitions, 2036 flow [2021-03-26 10:42:31,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 132 transitions, 2036 flow [2021-03-26 10:42:31,286 INFO L129 PetriNetUnfolder]: 223/554 cut-off events. [2021-03-26 10:42:31,286 INFO L130 PetriNetUnfolder]: For 6816/7114 co-relation queries the response was YES. [2021-03-26 10:42:31,288 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3547 conditions, 554 events. 223/554 cut-off events. For 6816/7114 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3681 event pairs, 23 based on Foata normal form. 72/612 useless extension candidates. Maximal degree in co-relation 3507. Up to 217 conditions per place. [2021-03-26 10:42:31,292 INFO L142 LiptonReduction]: Number of co-enabled transitions 764 [2021-03-26 10:42:31,342 INFO L154 LiptonReduction]: Checked pairs total: 2924 [2021-03-26 10:42:31,342 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:31,342 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 123 [2021-03-26 10:42:31,342 INFO L480 AbstractCegarLoop]: Abstraction has has 89 places, 132 transitions, 2036 flow [2021-03-26 10:42:31,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:31,343 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:31,343 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:31,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:42:31,343 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:31,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:31,343 INFO L82 PathProgramCache]: Analyzing trace with hash -796968011, now seen corresponding path program 1 times [2021-03-26 10:42:31,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:31,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86202621] [2021-03-26 10:42:31,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:31,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:31,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:31,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:31,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:31,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86202621] [2021-03-26 10:42:31,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:31,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:42:31,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795892943] [2021-03-26 10:42:31,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:42:31,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:31,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:42:31,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:42:31,372 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 178 [2021-03-26 10:42:31,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 132 transitions, 2036 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:31,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:31,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 178 [2021-03-26 10:42:31,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:31,474 INFO L129 PetriNetUnfolder]: 285/735 cut-off events. [2021-03-26 10:42:31,474 INFO L130 PetriNetUnfolder]: For 9118/9345 co-relation queries the response was YES. [2021-03-26 10:42:31,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4719 conditions, 735 events. 285/735 cut-off events. For 9118/9345 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5340 event pairs, 19 based on Foata normal form. 54/767 useless extension candidates. Maximal degree in co-relation 4677. Up to 300 conditions per place. [2021-03-26 10:42:31,479 INFO L132 encePairwiseOnDemand]: 175/178 looper letters, 3 selfloop transitions, 3 changer transitions 41/132 dead transitions. [2021-03-26 10:42:31,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 132 transitions, 2048 flow [2021-03-26 10:42:31,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:42:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:42:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2021-03-26 10:42:31,481 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8651685393258427 [2021-03-26 10:42:31,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2021-03-26 10:42:31,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2021-03-26 10:42:31,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:31,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2021-03-26 10:42:31,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:31,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:31,483 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:31,483 INFO L185 Difference]: Start difference. First operand has 89 places, 132 transitions, 2036 flow. Second operand 3 states and 462 transitions. [2021-03-26 10:42:31,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 132 transitions, 2048 flow [2021-03-26 10:42:31,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 132 transitions, 1971 flow, removed 20 selfloop flow, removed 2 redundant places. [2021-03-26 10:42:31,502 INFO L241 Difference]: Finished difference. Result has 90 places, 91 transitions, 1265 flow [2021-03-26 10:42:31,502 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=1959, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1265, PETRI_PLACES=90, PETRI_TRANSITIONS=91} [2021-03-26 10:42:31,503 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2021-03-26 10:42:31,503 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:31,503 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 91 transitions, 1265 flow [2021-03-26 10:42:31,503 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 91 transitions, 1265 flow [2021-03-26 10:42:31,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 91 transitions, 1265 flow [2021-03-26 10:42:31,570 INFO L129 PetriNetUnfolder]: 217/568 cut-off events. [2021-03-26 10:42:31,570 INFO L130 PetriNetUnfolder]: For 7499/7940 co-relation queries the response was YES. [2021-03-26 10:42:31,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3547 conditions, 568 events. 217/568 cut-off events. For 7499/7940 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 3965 event pairs, 12 based on Foata normal form. 84/638 useless extension candidates. Maximal degree in co-relation 3508. Up to 248 conditions per place. [2021-03-26 10:42:31,576 INFO L142 LiptonReduction]: Number of co-enabled transitions 520 [2021-03-26 10:42:32,556 WARN L205 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-26 10:42:32,954 WARN L205 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2021-03-26 10:42:35,097 WARN L205 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 377 DAG size of output: 315 [2021-03-26 10:42:35,984 WARN L205 SmtUtils]: Spent 884.00 ms on a formula simplification that was a NOOP. DAG size: 306 [2021-03-26 10:42:36,039 INFO L154 LiptonReduction]: Checked pairs total: 2118 [2021-03-26 10:42:36,039 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:42:36,039 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4536 [2021-03-26 10:42:36,040 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 91 transitions, 1273 flow [2021-03-26 10:42:36,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:36,040 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:36,040 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:36,040 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:42:36,040 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:36,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1598151559, now seen corresponding path program 1 times [2021-03-26 10:42:36,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:36,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033309286] [2021-03-26 10:42:36,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:36,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:36,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:36,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:36,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:36,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:36,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:42:36,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:36,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:42:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:36,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033309286] [2021-03-26 10:42:36,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:36,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:42:36,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061281560] [2021-03-26 10:42:36,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:42:36,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:36,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:42:36,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:42:36,118 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 179 [2021-03-26 10:42:36,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 91 transitions, 1273 flow. Second operand has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:36,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:36,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 179 [2021-03-26 10:42:36,119 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:36,436 INFO L129 PetriNetUnfolder]: 263/713 cut-off events. [2021-03-26 10:42:36,436 INFO L130 PetriNetUnfolder]: For 8503/8930 co-relation queries the response was YES. [2021-03-26 10:42:36,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4839 conditions, 713 events. 263/713 cut-off events. For 8503/8930 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 5338 event pairs, 0 based on Foata normal form. 114/811 useless extension candidates. Maximal degree in co-relation 4798. Up to 313 conditions per place. [2021-03-26 10:42:36,441 INFO L132 encePairwiseOnDemand]: 167/179 looper letters, 54 selfloop transitions, 44 changer transitions 18/129 dead transitions. [2021-03-26 10:42:36,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 129 transitions, 2039 flow [2021-03-26 10:42:36,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 10:42:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 10:42:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1167 transitions. [2021-03-26 10:42:36,444 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7243947858472998 [2021-03-26 10:42:36,444 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1167 transitions. [2021-03-26 10:42:36,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1167 transitions. [2021-03-26 10:42:36,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:36,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1167 transitions. [2021-03-26 10:42:36,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.66666666666666) internal successors, (1167), 9 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:36,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:36,448 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:36,448 INFO L185 Difference]: Start difference. First operand has 87 places, 91 transitions, 1273 flow. Second operand 9 states and 1167 transitions. [2021-03-26 10:42:36,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 129 transitions, 2039 flow [2021-03-26 10:42:36,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 129 transitions, 1937 flow, removed 11 selfloop flow, removed 8 redundant places. [2021-03-26 10:42:36,465 INFO L241 Difference]: Finished difference. Result has 92 places, 107 transitions, 1591 flow [2021-03-26 10:42:36,465 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1591, PETRI_PLACES=92, PETRI_TRANSITIONS=107} [2021-03-26 10:42:36,465 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 45 predicate places. [2021-03-26 10:42:36,465 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:36,465 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 107 transitions, 1591 flow [2021-03-26 10:42:36,466 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 107 transitions, 1591 flow [2021-03-26 10:42:36,467 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 92 places, 107 transitions, 1591 flow [2021-03-26 10:42:36,537 INFO L129 PetriNetUnfolder]: 205/574 cut-off events. [2021-03-26 10:42:36,537 INFO L130 PetriNetUnfolder]: For 8430/8763 co-relation queries the response was YES. [2021-03-26 10:42:36,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3935 conditions, 574 events. 205/574 cut-off events. For 8430/8763 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4187 event pairs, 10 based on Foata normal form. 68/625 useless extension candidates. Maximal degree in co-relation 3894. Up to 243 conditions per place. [2021-03-26 10:42:36,543 INFO L142 LiptonReduction]: Number of co-enabled transitions 596 [2021-03-26 10:42:36,605 INFO L154 LiptonReduction]: Checked pairs total: 1608 [2021-03-26 10:42:36,605 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:36,605 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 140 [2021-03-26 10:42:36,606 INFO L480 AbstractCegarLoop]: Abstraction has has 92 places, 107 transitions, 1591 flow [2021-03-26 10:42:36,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:36,606 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:36,606 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:36,606 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:42:36,606 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:36,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:36,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1491029817, now seen corresponding path program 2 times [2021-03-26 10:42:36,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:36,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185884207] [2021-03-26 10:42:36,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:36,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:36,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:36,669 INFO L142 QuantifierPusher]: treesize reduction 2, result has 94.6 percent of original size [2021-03-26 10:42:36,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 10:42:36,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:36,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 10:42:36,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:36,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:42:36,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:36,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:36,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185884207] [2021-03-26 10:42:36,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:36,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:42:36,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844861157] [2021-03-26 10:42:36,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:42:36,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:36,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:42:36,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:42:36,743 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 179 [2021-03-26 10:42:36,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 107 transitions, 1591 flow. Second operand has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:36,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:36,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 179 [2021-03-26 10:42:36,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:37,093 INFO L129 PetriNetUnfolder]: 236/680 cut-off events. [2021-03-26 10:42:37,093 INFO L130 PetriNetUnfolder]: For 10784/11356 co-relation queries the response was YES. [2021-03-26 10:42:37,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5061 conditions, 680 events. 236/680 cut-off events. For 10784/11356 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5219 event pairs, 2 based on Foata normal form. 180/846 useless extension candidates. Maximal degree in co-relation 5018. Up to 309 conditions per place. [2021-03-26 10:42:37,097 INFO L132 encePairwiseOnDemand]: 168/179 looper letters, 54 selfloop transitions, 56 changer transitions 12/135 dead transitions. [2021-03-26 10:42:37,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 135 transitions, 2251 flow [2021-03-26 10:42:37,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 10:42:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 10:42:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1370 transitions. [2021-03-26 10:42:37,101 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6957846622651092 [2021-03-26 10:42:37,101 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1370 transitions. [2021-03-26 10:42:37,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1370 transitions. [2021-03-26 10:42:37,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:37,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1370 transitions. [2021-03-26 10:42:37,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 124.54545454545455) internal successors, (1370), 11 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:37,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:37,115 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:37,116 INFO L185 Difference]: Start difference. First operand has 92 places, 107 transitions, 1591 flow. Second operand 11 states and 1370 transitions. [2021-03-26 10:42:37,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 135 transitions, 2251 flow [2021-03-26 10:42:37,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 135 transitions, 2182 flow, removed 34 selfloop flow, removed 1 redundant places. [2021-03-26 10:42:37,135 INFO L241 Difference]: Finished difference. Result has 104 places, 114 transitions, 1797 flow [2021-03-26 10:42:37,136 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1797, PETRI_PLACES=104, PETRI_TRANSITIONS=114} [2021-03-26 10:42:37,136 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 57 predicate places. [2021-03-26 10:42:37,136 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:37,136 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 114 transitions, 1797 flow [2021-03-26 10:42:37,136 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 114 transitions, 1797 flow [2021-03-26 10:42:37,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 114 transitions, 1797 flow [2021-03-26 10:42:37,216 INFO L129 PetriNetUnfolder]: 222/629 cut-off events. [2021-03-26 10:42:37,216 INFO L130 PetriNetUnfolder]: For 9232/9643 co-relation queries the response was YES. [2021-03-26 10:42:37,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4360 conditions, 629 events. 222/629 cut-off events. For 9232/9643 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4692 event pairs, 3 based on Foata normal form. 78/689 useless extension candidates. Maximal degree in co-relation 4315. Up to 254 conditions per place. [2021-03-26 10:42:37,223 INFO L142 LiptonReduction]: Number of co-enabled transitions 630 [2021-03-26 10:42:37,288 INFO L154 LiptonReduction]: Checked pairs total: 1831 [2021-03-26 10:42:37,288 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:37,288 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 152 [2021-03-26 10:42:37,290 INFO L480 AbstractCegarLoop]: Abstraction has has 103 places, 114 transitions, 1797 flow [2021-03-26 10:42:37,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:37,291 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:37,291 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:37,291 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 10:42:37,291 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:37,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:37,292 INFO L82 PathProgramCache]: Analyzing trace with hash -383884727, now seen corresponding path program 3 times [2021-03-26 10:42:37,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:37,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89729530] [2021-03-26 10:42:37,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:37,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:37,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:37,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:37,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 10:42:37,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:37,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:42:37,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:37,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 10:42:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:37,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89729530] [2021-03-26 10:42:37,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:37,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:42:37,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797006580] [2021-03-26 10:42:37,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:42:37,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:37,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:42:37,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:42:37,412 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 179 [2021-03-26 10:42:37,412 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 114 transitions, 1797 flow. Second operand has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:37,412 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:37,412 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 179 [2021-03-26 10:42:37,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:37,684 INFO L129 PetriNetUnfolder]: 240/695 cut-off events. [2021-03-26 10:42:37,684 INFO L130 PetriNetUnfolder]: For 11233/11699 co-relation queries the response was YES. [2021-03-26 10:42:37,686 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5291 conditions, 695 events. 240/695 cut-off events. For 11233/11699 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5338 event pairs, 0 based on Foata normal form. 166/847 useless extension candidates. Maximal degree in co-relation 5244. Up to 344 conditions per place. [2021-03-26 10:42:37,688 INFO L132 encePairwiseOnDemand]: 167/179 looper letters, 74 selfloop transitions, 40 changer transitions 10/137 dead transitions. [2021-03-26 10:42:37,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 137 transitions, 2419 flow [2021-03-26 10:42:37,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 10:42:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 10:42:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1295 transitions. [2021-03-26 10:42:37,692 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.723463687150838 [2021-03-26 10:42:37,692 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1295 transitions. [2021-03-26 10:42:37,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1295 transitions. [2021-03-26 10:42:37,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:37,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1295 transitions. [2021-03-26 10:42:37,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 129.5) internal successors, (1295), 10 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:37,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 179.0) internal successors, (1969), 11 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:37,696 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 179.0) internal successors, (1969), 11 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:37,696 INFO L185 Difference]: Start difference. First operand has 103 places, 114 transitions, 1797 flow. Second operand 10 states and 1295 transitions. [2021-03-26 10:42:37,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 137 transitions, 2419 flow [2021-03-26 10:42:37,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 137 transitions, 2328 flow, removed 27 selfloop flow, removed 3 redundant places. [2021-03-26 10:42:37,718 INFO L241 Difference]: Finished difference. Result has 112 places, 124 transitions, 2044 flow [2021-03-26 10:42:37,718 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1721, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2044, PETRI_PLACES=112, PETRI_TRANSITIONS=124} [2021-03-26 10:42:37,718 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 65 predicate places. [2021-03-26 10:42:37,718 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:37,718 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 124 transitions, 2044 flow [2021-03-26 10:42:37,718 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 124 transitions, 2044 flow [2021-03-26 10:42:37,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 124 transitions, 2044 flow [2021-03-26 10:42:37,797 INFO L129 PetriNetUnfolder]: 217/625 cut-off events. [2021-03-26 10:42:37,798 INFO L130 PetriNetUnfolder]: For 10214/10486 co-relation queries the response was YES. [2021-03-26 10:42:37,799 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4476 conditions, 625 events. 217/625 cut-off events. For 10214/10486 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4681 event pairs, 3 based on Foata normal form. 92/699 useless extension candidates. Maximal degree in co-relation 4428. Up to 253 conditions per place. [2021-03-26 10:42:37,804 INFO L142 LiptonReduction]: Number of co-enabled transitions 676 [2021-03-26 10:42:38,011 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-26 10:42:38,385 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2021-03-26 10:42:38,515 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-26 10:42:38,618 INFO L154 LiptonReduction]: Checked pairs total: 4103 [2021-03-26 10:42:38,618 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:42:38,618 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 900 [2021-03-26 10:42:38,618 INFO L480 AbstractCegarLoop]: Abstraction has has 112 places, 124 transitions, 2053 flow [2021-03-26 10:42:38,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:38,619 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:38,619 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:38,619 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 10:42:38,619 INFO L428 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:38,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:38,619 INFO L82 PathProgramCache]: Analyzing trace with hash -798588073, now seen corresponding path program 4 times [2021-03-26 10:42:38,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:38,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657387400] [2021-03-26 10:42:38,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:38,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:38,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:42:38,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:38,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:42:38,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:38,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:42:38,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:38,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:42:38,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:38,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:42:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:38,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657387400] [2021-03-26 10:42:38,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:38,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:42:38,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846615794] [2021-03-26 10:42:38,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:42:38,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:38,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:42:38,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:42:38,744 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 180 [2021-03-26 10:42:38,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 124 transitions, 2053 flow. Second operand has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:38,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:38,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 180 [2021-03-26 10:42:38,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:39,077 INFO L129 PetriNetUnfolder]: 218/647 cut-off events. [2021-03-26 10:42:39,077 INFO L130 PetriNetUnfolder]: For 11666/12119 co-relation queries the response was YES. [2021-03-26 10:42:39,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 647 events. 218/647 cut-off events. For 11666/12119 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 4939 event pairs, 0 based on Foata normal form. 193/827 useless extension candidates. Maximal degree in co-relation 5009. Up to 312 conditions per place. [2021-03-26 10:42:39,081 INFO L132 encePairwiseOnDemand]: 169/180 looper letters, 66 selfloop transitions, 45 changer transitions 7/131 dead transitions. [2021-03-26 10:42:39,081 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 131 transitions, 2410 flow [2021-03-26 10:42:39,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 10:42:39,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 10:42:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1129 transitions. [2021-03-26 10:42:39,084 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6969135802469136 [2021-03-26 10:42:39,086 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1129 transitions. [2021-03-26 10:42:39,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1129 transitions. [2021-03-26 10:42:39,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:39,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1129 transitions. [2021-03-26 10:42:39,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.44444444444444) internal successors, (1129), 9 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:39,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:39,090 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:39,090 INFO L185 Difference]: Start difference. First operand has 112 places, 124 transitions, 2053 flow. Second operand 9 states and 1129 transitions. [2021-03-26 10:42:39,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 131 transitions, 2410 flow [2021-03-26 10:42:39,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 131 transitions, 2327 flow, removed 13 selfloop flow, removed 6 redundant places. [2021-03-26 10:42:39,116 INFO L241 Difference]: Finished difference. Result has 116 places, 121 transitions, 2049 flow [2021-03-26 10:42:39,116 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1970, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2049, PETRI_PLACES=116, PETRI_TRANSITIONS=121} [2021-03-26 10:42:39,116 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 69 predicate places. [2021-03-26 10:42:39,116 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:39,116 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 121 transitions, 2049 flow [2021-03-26 10:42:39,117 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 121 transitions, 2049 flow [2021-03-26 10:42:39,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 121 transitions, 2049 flow [2021-03-26 10:42:39,212 INFO L129 PetriNetUnfolder]: 203/604 cut-off events. [2021-03-26 10:42:39,213 INFO L130 PetriNetUnfolder]: For 10159/10394 co-relation queries the response was YES. [2021-03-26 10:42:39,215 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4454 conditions, 604 events. 203/604 cut-off events. For 10159/10394 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4578 event pairs, 0 based on Foata normal form. 88/677 useless extension candidates. Maximal degree in co-relation 4405. Up to 238 conditions per place. [2021-03-26 10:42:39,220 INFO L142 LiptonReduction]: Number of co-enabled transitions 666 [2021-03-26 10:42:39,918 WARN L205 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-26 10:42:40,134 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 10:42:41,369 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 339 DAG size of output: 262 [2021-03-26 10:42:41,844 WARN L205 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-26 10:42:41,926 INFO L154 LiptonReduction]: Checked pairs total: 3806 [2021-03-26 10:42:41,926 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:42:41,926 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2810 [2021-03-26 10:42:41,926 INFO L480 AbstractCegarLoop]: Abstraction has has 116 places, 121 transitions, 2075 flow [2021-03-26 10:42:41,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:41,927 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:41,927 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:41,927 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 10:42:41,927 INFO L428 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:41,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:41,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1642709600, now seen corresponding path program 1 times [2021-03-26 10:42:41,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:41,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039515699] [2021-03-26 10:42:41,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:41,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:41,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:41,978 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:42:41,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:41,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:41,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:41,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039515699] [2021-03-26 10:42:41,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:41,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:42:41,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687541773] [2021-03-26 10:42:41,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:42:41,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:41,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:42:41,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:42:41,988 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2021-03-26 10:42:41,989 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 121 transitions, 2075 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:41,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:41,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2021-03-26 10:42:41,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:42,131 INFO L129 PetriNetUnfolder]: 383/972 cut-off events. [2021-03-26 10:42:42,131 INFO L130 PetriNetUnfolder]: For 18127/18463 co-relation queries the response was YES. [2021-03-26 10:42:42,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4435 conditions, 972 events. 383/972 cut-off events. For 18127/18463 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 7691 event pairs, 102 based on Foata normal form. 259/1186 useless extension candidates. Maximal degree in co-relation 4384. Up to 557 conditions per place. [2021-03-26 10:42:42,137 INFO L132 encePairwiseOnDemand]: 174/181 looper letters, 13 selfloop transitions, 8 changer transitions 0/97 dead transitions. [2021-03-26 10:42:42,137 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 97 transitions, 1509 flow [2021-03-26 10:42:42,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:42:42,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:42:42,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2021-03-26 10:42:42,139 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8519337016574585 [2021-03-26 10:42:42,139 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 771 transitions. [2021-03-26 10:42:42,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 771 transitions. [2021-03-26 10:42:42,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:42,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 771 transitions. [2021-03-26 10:42:42,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.2) internal successors, (771), 5 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:42,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:42,141 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:42,141 INFO L185 Difference]: Start difference. First operand has 116 places, 121 transitions, 2075 flow. Second operand 5 states and 771 transitions. [2021-03-26 10:42:42,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 97 transitions, 1509 flow [2021-03-26 10:42:42,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 97 transitions, 1352 flow, removed 16 selfloop flow, removed 21 redundant places. [2021-03-26 10:42:42,163 INFO L241 Difference]: Finished difference. Result has 101 places, 94 transitions, 1370 flow [2021-03-26 10:42:42,163 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1370, PETRI_PLACES=101, PETRI_TRANSITIONS=94} [2021-03-26 10:42:42,163 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 54 predicate places. [2021-03-26 10:42:42,163 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:42,163 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 94 transitions, 1370 flow [2021-03-26 10:42:42,164 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 94 transitions, 1370 flow [2021-03-26 10:42:42,164 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 94 transitions, 1370 flow [2021-03-26 10:42:42,250 INFO L129 PetriNetUnfolder]: 389/971 cut-off events. [2021-03-26 10:42:42,250 INFO L130 PetriNetUnfolder]: For 10336/10716 co-relation queries the response was YES. [2021-03-26 10:42:42,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4834 conditions, 971 events. 389/971 cut-off events. For 10336/10716 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 7746 event pairs, 102 based on Foata normal form. 85/991 useless extension candidates. Maximal degree in co-relation 4791. Up to 567 conditions per place. [2021-03-26 10:42:42,259 INFO L142 LiptonReduction]: Number of co-enabled transitions 642 [2021-03-26 10:42:43,055 WARN L205 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 167 [2021-03-26 10:42:43,260 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-03-26 10:42:44,977 WARN L205 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 391 DAG size of output: 267 [2021-03-26 10:42:45,510 WARN L205 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 240 [2021-03-26 10:42:46,276 WARN L205 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 160 [2021-03-26 10:42:46,479 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-03-26 10:42:48,705 WARN L205 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 377 DAG size of output: 240 [2021-03-26 10:42:49,205 WARN L205 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 220 [2021-03-26 10:42:49,452 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-26 10:42:49,676 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-26 10:42:50,157 WARN L205 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 228 [2021-03-26 10:42:50,641 WARN L205 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 226 [2021-03-26 10:42:50,831 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-26 10:42:51,276 WARN L205 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2021-03-26 10:42:51,411 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 10:42:51,639 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-26 10:42:51,858 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-26 10:42:52,459 WARN L205 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 248 [2021-03-26 10:42:53,067 WARN L205 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 246 [2021-03-26 10:42:53,074 INFO L154 LiptonReduction]: Checked pairs total: 20 [2021-03-26 10:42:53,074 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:42:53,074 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10911 [2021-03-26 10:42:53,074 INFO L480 AbstractCegarLoop]: Abstraction has has 101 places, 94 transitions, 1395 flow [2021-03-26 10:42:53,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:53,074 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:53,075 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:53,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-26 10:42:53,075 INFO L428 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:53,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:53,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1107170544, now seen corresponding path program 1 times [2021-03-26 10:42:53,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:53,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549407895] [2021-03-26 10:42:53,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:53,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:53,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:53,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:53,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:53,118 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:42:53,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:53,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:53,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:53,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549407895] [2021-03-26 10:42:53,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:53,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:42:53,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619719438] [2021-03-26 10:42:53,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:42:53,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:53,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:42:53,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:42:53,130 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 186 [2021-03-26 10:42:53,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 94 transitions, 1395 flow. Second operand has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:53,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:53,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 186 [2021-03-26 10:42:53,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:53,271 INFO L129 PetriNetUnfolder]: 239/731 cut-off events. [2021-03-26 10:42:53,271 INFO L130 PetriNetUnfolder]: For 11850/13311 co-relation queries the response was YES. [2021-03-26 10:42:53,274 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3791 conditions, 731 events. 239/731 cut-off events. For 11850/13311 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 6170 event pairs, 9 based on Foata normal form. 572/1257 useless extension candidates. Maximal degree in co-relation 3746. Up to 484 conditions per place. [2021-03-26 10:42:53,277 INFO L132 encePairwiseOnDemand]: 179/186 looper letters, 6 selfloop transitions, 15 changer transitions 6/89 dead transitions. [2021-03-26 10:42:53,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 89 transitions, 1261 flow [2021-03-26 10:42:53,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:42:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:42:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1113 transitions. [2021-03-26 10:42:53,280 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8548387096774194 [2021-03-26 10:42:53,280 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1113 transitions. [2021-03-26 10:42:53,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1113 transitions. [2021-03-26 10:42:53,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:53,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1113 transitions. [2021-03-26 10:42:53,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.0) internal successors, (1113), 7 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:53,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 186.0) internal successors, (1488), 8 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:53,283 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 186.0) internal successors, (1488), 8 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:53,283 INFO L185 Difference]: Start difference. First operand has 101 places, 94 transitions, 1395 flow. Second operand 7 states and 1113 transitions. [2021-03-26 10:42:53,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 89 transitions, 1261 flow [2021-03-26 10:42:53,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 89 transitions, 1133 flow, removed 22 selfloop flow, removed 12 redundant places. [2021-03-26 10:42:53,296 INFO L241 Difference]: Finished difference. Result has 98 places, 83 transitions, 1089 flow [2021-03-26 10:42:53,296 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1089, PETRI_PLACES=98, PETRI_TRANSITIONS=83} [2021-03-26 10:42:53,296 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 51 predicate places. [2021-03-26 10:42:53,296 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:53,297 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 83 transitions, 1089 flow [2021-03-26 10:42:53,298 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 83 transitions, 1089 flow [2021-03-26 10:42:53,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 83 transitions, 1089 flow [2021-03-26 10:42:53,352 INFO L129 PetriNetUnfolder]: 213/682 cut-off events. [2021-03-26 10:42:53,352 INFO L130 PetriNetUnfolder]: For 6232/6699 co-relation queries the response was YES. [2021-03-26 10:42:53,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3707 conditions, 682 events. 213/682 cut-off events. For 6232/6699 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 5826 event pairs, 9 based on Foata normal form. 37/685 useless extension candidates. Maximal degree in co-relation 3666. Up to 446 conditions per place. [2021-03-26 10:42:53,357 INFO L142 LiptonReduction]: Number of co-enabled transitions 670 [2021-03-26 10:42:53,359 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:42:53,359 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:53,360 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 64 [2021-03-26 10:42:53,360 INFO L480 AbstractCegarLoop]: Abstraction has has 98 places, 83 transitions, 1089 flow [2021-03-26 10:42:53,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:53,360 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:53,360 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:53,360 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-26 10:42:53,360 INFO L428 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:53,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:53,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1926844266, now seen corresponding path program 1 times [2021-03-26 10:42:53,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:53,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025656415] [2021-03-26 10:42:53,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:53,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:53,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:53,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:53,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:53,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:53,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:53,406 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:42:53,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:53,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025656415] [2021-03-26 10:42:53,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:53,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:42:53,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518648790] [2021-03-26 10:42:53,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:42:53,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:53,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:42:53,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:42:53,418 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 186 [2021-03-26 10:42:53,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 83 transitions, 1089 flow. Second operand has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:53,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:53,418 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 186 [2021-03-26 10:42:53,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:53,581 INFO L129 PetriNetUnfolder]: 191/638 cut-off events. [2021-03-26 10:42:53,581 INFO L130 PetriNetUnfolder]: For 8552/10354 co-relation queries the response was YES. [2021-03-26 10:42:53,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3819 conditions, 638 events. 191/638 cut-off events. For 8552/10354 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 5486 event pairs, 0 based on Foata normal form. 552/1145 useless extension candidates. Maximal degree in co-relation 3776. Up to 432 conditions per place. [2021-03-26 10:42:53,585 INFO L132 encePairwiseOnDemand]: 179/186 looper letters, 2 selfloop transitions, 19 changer transitions 15/83 dead transitions. [2021-03-26 10:42:53,585 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 83 transitions, 1105 flow [2021-03-26 10:42:53,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 10:42:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 10:42:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1424 transitions. [2021-03-26 10:42:53,589 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8506571087216248 [2021-03-26 10:42:53,589 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1424 transitions. [2021-03-26 10:42:53,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1424 transitions. [2021-03-26 10:42:53,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:53,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1424 transitions. [2021-03-26 10:42:53,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:53,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 186.0) internal successors, (1860), 10 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:53,593 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 186.0) internal successors, (1860), 10 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:53,593 INFO L185 Difference]: Start difference. First operand has 98 places, 83 transitions, 1089 flow. Second operand 9 states and 1424 transitions. [2021-03-26 10:42:53,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 83 transitions, 1105 flow [2021-03-26 10:42:53,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 83 transitions, 976 flow, removed 22 selfloop flow, removed 7 redundant places. [2021-03-26 10:42:53,610 INFO L241 Difference]: Finished difference. Result has 102 places, 68 transitions, 804 flow [2021-03-26 10:42:53,610 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=804, PETRI_PLACES=102, PETRI_TRANSITIONS=68} [2021-03-26 10:42:53,610 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 55 predicate places. [2021-03-26 10:42:53,611 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:53,611 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 68 transitions, 804 flow [2021-03-26 10:42:53,611 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 68 transitions, 804 flow [2021-03-26 10:42:53,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 68 transitions, 804 flow [2021-03-26 10:42:53,639 INFO L129 PetriNetUnfolder]: 101/366 cut-off events. [2021-03-26 10:42:53,639 INFO L130 PetriNetUnfolder]: For 2490/2583 co-relation queries the response was YES. [2021-03-26 10:42:53,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1850 conditions, 366 events. 101/366 cut-off events. For 2490/2583 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 2785 event pairs, 0 based on Foata normal form. 11/356 useless extension candidates. Maximal degree in co-relation 1809. Up to 110 conditions per place. [2021-03-26 10:42:53,642 INFO L142 LiptonReduction]: Number of co-enabled transitions 476 [2021-03-26 10:42:54,428 WARN L205 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 160 [2021-03-26 10:42:54,642 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-03-26 10:42:56,395 WARN L205 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 377 DAG size of output: 236 [2021-03-26 10:42:56,914 WARN L205 SmtUtils]: Spent 517.00 ms on a formula simplification that was a NOOP. DAG size: 218 [2021-03-26 10:42:57,209 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:42:57,497 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:42:58,199 WARN L205 SmtUtils]: Spent 700.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 10:42:58,868 WARN L205 SmtUtils]: Spent 667.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 10:42:58,873 INFO L154 LiptonReduction]: Checked pairs total: 83 [2021-03-26 10:42:58,873 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:42:58,873 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5262 [2021-03-26 10:42:58,873 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 64 transitions, 781 flow [2021-03-26 10:42:58,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:58,873 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:58,873 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:58,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-26 10:42:58,874 INFO L428 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:58,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:58,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1764954835, now seen corresponding path program 1 times [2021-03-26 10:42:58,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:58,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498438599] [2021-03-26 10:42:58,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:58,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:58,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:58,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:58,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:58,922 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 10:42:58,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 10:42:58,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:58,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:58,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498438599] [2021-03-26 10:42:58,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:58,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:42:58,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851342120] [2021-03-26 10:42:58,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:42:58,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:58,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:42:58,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:42:58,955 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 188 [2021-03-26 10:42:58,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 64 transitions, 781 flow. Second operand has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:58,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:58,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 188 [2021-03-26 10:42:58,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:59,129 INFO L129 PetriNetUnfolder]: 63/205 cut-off events. [2021-03-26 10:42:59,129 INFO L130 PetriNetUnfolder]: For 2727/2825 co-relation queries the response was YES. [2021-03-26 10:42:59,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 205 events. 63/205 cut-off events. For 2727/2825 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1141 event pairs, 0 based on Foata normal form. 42/239 useless extension candidates. Maximal degree in co-relation 1213. Up to 71 conditions per place. [2021-03-26 10:42:59,130 INFO L132 encePairwiseOnDemand]: 176/188 looper letters, 19 selfloop transitions, 17 changer transitions 5/59 dead transitions. [2021-03-26 10:42:59,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 59 transitions, 818 flow [2021-03-26 10:42:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:42:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:42:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1002 transitions. [2021-03-26 10:42:59,132 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6662234042553191 [2021-03-26 10:42:59,132 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1002 transitions. [2021-03-26 10:42:59,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1002 transitions. [2021-03-26 10:42:59,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:59,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1002 transitions. [2021-03-26 10:42:59,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.25) internal successors, (1002), 8 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:59,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:59,135 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:59,135 INFO L185 Difference]: Start difference. First operand has 99 places, 64 transitions, 781 flow. Second operand 8 states and 1002 transitions. [2021-03-26 10:42:59,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 59 transitions, 818 flow [2021-03-26 10:42:59,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 59 transitions, 700 flow, removed 31 selfloop flow, removed 14 redundant places. [2021-03-26 10:42:59,141 INFO L241 Difference]: Finished difference. Result has 86 places, 54 transitions, 607 flow [2021-03-26 10:42:59,141 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=607, PETRI_PLACES=86, PETRI_TRANSITIONS=54} [2021-03-26 10:42:59,141 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 39 predicate places. [2021-03-26 10:42:59,142 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:59,142 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 54 transitions, 607 flow [2021-03-26 10:42:59,142 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 54 transitions, 607 flow [2021-03-26 10:42:59,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 54 transitions, 607 flow [2021-03-26 10:42:59,158 INFO L129 PetriNetUnfolder]: 51/168 cut-off events. [2021-03-26 10:42:59,158 INFO L130 PetriNetUnfolder]: For 1067/1076 co-relation queries the response was YES. [2021-03-26 10:42:59,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 168 events. 51/168 cut-off events. For 1067/1076 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 895 event pairs, 0 based on Foata normal form. 7/169 useless extension candidates. Maximal degree in co-relation 801. Up to 42 conditions per place. [2021-03-26 10:42:59,159 INFO L142 LiptonReduction]: Number of co-enabled transitions 202 [2021-03-26 10:42:59,160 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:42:59,160 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:59,160 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-26 10:42:59,161 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 54 transitions, 607 flow [2021-03-26 10:42:59,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:59,161 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:59,161 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:59,161 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-26 10:42:59,161 INFO L428 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:59,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:59,161 INFO L82 PathProgramCache]: Analyzing trace with hash 343083460, now seen corresponding path program 1 times [2021-03-26 10:42:59,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:59,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828224793] [2021-03-26 10:42:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:59,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:59,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:59,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:59,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:42:59,229 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.9 percent of original size [2021-03-26 10:42:59,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-26 10:42:59,262 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.1 percent of original size [2021-03-26 10:42:59,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-26 10:42:59,295 INFO L142 QuantifierPusher]: treesize reduction 3, result has 72.7 percent of original size [2021-03-26 10:42:59,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 10:42:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:59,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828224793] [2021-03-26 10:42:59,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:59,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:42:59,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576657708] [2021-03-26 10:42:59,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:42:59,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:59,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:42:59,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:42:59,309 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 188 [2021-03-26 10:42:59,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 54 transitions, 607 flow. Second operand has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:59,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:59,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 188 [2021-03-26 10:42:59,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:59,591 INFO L129 PetriNetUnfolder]: 79/258 cut-off events. [2021-03-26 10:42:59,591 INFO L130 PetriNetUnfolder]: For 2235/2299 co-relation queries the response was YES. [2021-03-26 10:42:59,592 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 258 events. 79/258 cut-off events. For 2235/2299 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1587 event pairs, 0 based on Foata normal form. 36/282 useless extension candidates. Maximal degree in co-relation 1209. Up to 83 conditions per place. [2021-03-26 10:42:59,593 INFO L132 encePairwiseOnDemand]: 180/188 looper letters, 22 selfloop transitions, 10 changer transitions 9/59 dead transitions. [2021-03-26 10:42:59,593 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 59 transitions, 784 flow [2021-03-26 10:42:59,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:42:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:42:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1002 transitions. [2021-03-26 10:42:59,596 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6662234042553191 [2021-03-26 10:42:59,596 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1002 transitions. [2021-03-26 10:42:59,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1002 transitions. [2021-03-26 10:42:59,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:59,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1002 transitions. [2021-03-26 10:42:59,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.25) internal successors, (1002), 8 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:59,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:59,600 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:59,600 INFO L185 Difference]: Start difference. First operand has 85 places, 54 transitions, 607 flow. Second operand 8 states and 1002 transitions. [2021-03-26 10:42:59,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 59 transitions, 784 flow [2021-03-26 10:42:59,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 59 transitions, 710 flow, removed 9 selfloop flow, removed 11 redundant places. [2021-03-26 10:42:59,606 INFO L241 Difference]: Finished difference. Result has 83 places, 47 transitions, 500 flow [2021-03-26 10:42:59,606 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=500, PETRI_PLACES=83, PETRI_TRANSITIONS=47} [2021-03-26 10:42:59,606 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 36 predicate places. [2021-03-26 10:42:59,606 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:59,606 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 47 transitions, 500 flow [2021-03-26 10:42:59,606 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 47 transitions, 500 flow [2021-03-26 10:42:59,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 47 transitions, 500 flow [2021-03-26 10:42:59,622 INFO L129 PetriNetUnfolder]: 51/182 cut-off events. [2021-03-26 10:42:59,622 INFO L130 PetriNetUnfolder]: For 1207/1214 co-relation queries the response was YES. [2021-03-26 10:42:59,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 182 events. 51/182 cut-off events. For 1207/1214 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1010 event pairs, 0 based on Foata normal form. 7/182 useless extension candidates. Maximal degree in co-relation 808. Up to 55 conditions per place. [2021-03-26 10:42:59,624 INFO L142 LiptonReduction]: Number of co-enabled transitions 168 [2021-03-26 10:42:59,626 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:42:59,626 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:59,626 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-26 10:42:59,626 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 47 transitions, 500 flow [2021-03-26 10:42:59,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:59,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:59,626 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:59,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-26 10:42:59,627 INFO L428 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:59,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:59,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2096319906, now seen corresponding path program 1 times [2021-03-26 10:42:59,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:59,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484550494] [2021-03-26 10:42:59,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:59,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:59,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:42:59,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:59,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:42:59,691 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.8 percent of original size [2021-03-26 10:42:59,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 10:42:59,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:59,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:42:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:59,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484550494] [2021-03-26 10:42:59,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:59,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:42:59,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245542179] [2021-03-26 10:42:59,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:42:59,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:59,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:42:59,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:42:59,723 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 188 [2021-03-26 10:42:59,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 47 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:59,724 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:59,724 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 188 [2021-03-26 10:42:59,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:59,892 INFO L129 PetriNetUnfolder]: 72/247 cut-off events. [2021-03-26 10:42:59,893 INFO L130 PetriNetUnfolder]: For 1996/2042 co-relation queries the response was YES. [2021-03-26 10:42:59,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 247 events. 72/247 cut-off events. For 1996/2042 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1506 event pairs, 0 based on Foata normal form. 27/263 useless extension candidates. Maximal degree in co-relation 1133. Up to 79 conditions per place. [2021-03-26 10:42:59,894 INFO L132 encePairwiseOnDemand]: 179/188 looper letters, 18 selfloop transitions, 8 changer transitions 12/56 dead transitions. [2021-03-26 10:42:59,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 56 transitions, 695 flow [2021-03-26 10:42:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:42:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:42:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 849 transitions. [2021-03-26 10:42:59,896 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6451367781155015 [2021-03-26 10:42:59,896 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 849 transitions. [2021-03-26 10:42:59,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 849 transitions. [2021-03-26 10:42:59,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:59,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 849 transitions. [2021-03-26 10:42:59,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:59,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:59,898 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:59,898 INFO L185 Difference]: Start difference. First operand has 79 places, 47 transitions, 500 flow. Second operand 7 states and 849 transitions. [2021-03-26 10:42:59,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 56 transitions, 695 flow [2021-03-26 10:42:59,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 56 transitions, 620 flow, removed 15 selfloop flow, removed 9 redundant places. [2021-03-26 10:42:59,903 INFO L241 Difference]: Finished difference. Result has 79 places, 44 transitions, 426 flow [2021-03-26 10:42:59,903 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=426, PETRI_PLACES=79, PETRI_TRANSITIONS=44} [2021-03-26 10:42:59,903 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2021-03-26 10:42:59,903 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:59,903 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 44 transitions, 426 flow [2021-03-26 10:42:59,903 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 44 transitions, 426 flow [2021-03-26 10:42:59,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 44 transitions, 426 flow [2021-03-26 10:42:59,918 INFO L129 PetriNetUnfolder]: 43/160 cut-off events. [2021-03-26 10:42:59,918 INFO L130 PetriNetUnfolder]: For 754/771 co-relation queries the response was YES. [2021-03-26 10:42:59,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 160 events. 43/160 cut-off events. For 754/771 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 853 event pairs, 0 based on Foata normal form. 7/158 useless extension candidates. Maximal degree in co-relation 646. Up to 47 conditions per place. [2021-03-26 10:42:59,919 INFO L142 LiptonReduction]: Number of co-enabled transitions 164 [2021-03-26 10:42:59,920 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:42:59,920 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:59,920 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-26 10:42:59,920 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 44 transitions, 426 flow [2021-03-26 10:42:59,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:59,920 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:59,921 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:59,921 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-26 10:42:59,921 INFO L428 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:59,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:59,921 INFO L82 PathProgramCache]: Analyzing trace with hash 552382254, now seen corresponding path program 2 times [2021-03-26 10:42:59,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:59,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948857171] [2021-03-26 10:42:59,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:59,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:59,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:42:59,988 INFO L142 QuantifierPusher]: treesize reduction 4, result has 78.9 percent of original size [2021-03-26 10:42:59,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:43:00,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:00,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 10:43:00,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:00,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-26 10:43:00,127 INFO L142 QuantifierPusher]: treesize reduction 6, result has 81.3 percent of original size [2021-03-26 10:43:00,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 10:43:00,158 INFO L142 QuantifierPusher]: treesize reduction 6, result has 66.7 percent of original size [2021-03-26 10:43:00,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 10:43:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:43:00,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948857171] [2021-03-26 10:43:00,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:43:00,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:43:00,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582726494] [2021-03-26 10:43:00,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:43:00,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:43:00,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:43:00,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:43:00,178 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 188 [2021-03-26 10:43:00,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 44 transitions, 426 flow. Second operand has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:00,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:43:00,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 188 [2021-03-26 10:43:00,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:43:00,625 INFO L129 PetriNetUnfolder]: 47/171 cut-off events. [2021-03-26 10:43:00,625 INFO L130 PetriNetUnfolder]: For 907/935 co-relation queries the response was YES. [2021-03-26 10:43:00,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 171 events. 47/171 cut-off events. For 907/935 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 936 event pairs, 0 based on Foata normal form. 22/184 useless extension candidates. Maximal degree in co-relation 741. Up to 50 conditions per place. [2021-03-26 10:43:00,626 INFO L132 encePairwiseOnDemand]: 178/188 looper letters, 10 selfloop transitions, 13 changer transitions 7/48 dead transitions. [2021-03-26 10:43:00,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 48 transitions, 530 flow [2021-03-26 10:43:00,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 10:43:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 10:43:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1214 transitions. [2021-03-26 10:43:00,628 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6457446808510638 [2021-03-26 10:43:00,628 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1214 transitions. [2021-03-26 10:43:00,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1214 transitions. [2021-03-26 10:43:00,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:43:00,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1214 transitions. [2021-03-26 10:43:00,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.4) internal successors, (1214), 10 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:00,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 188.0) internal successors, (2068), 11 states have internal predecessors, (2068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:00,631 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 188.0) internal successors, (2068), 11 states have internal predecessors, (2068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:00,631 INFO L185 Difference]: Start difference. First operand has 77 places, 44 transitions, 426 flow. Second operand 10 states and 1214 transitions. [2021-03-26 10:43:00,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 48 transitions, 530 flow [2021-03-26 10:43:00,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 48 transitions, 510 flow, removed 2 selfloop flow, removed 7 redundant places. [2021-03-26 10:43:00,634 INFO L241 Difference]: Finished difference. Result has 81 places, 40 transitions, 391 flow [2021-03-26 10:43:00,634 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=391, PETRI_PLACES=81, PETRI_TRANSITIONS=40} [2021-03-26 10:43:00,635 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 34 predicate places. [2021-03-26 10:43:00,635 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:43:00,635 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 40 transitions, 391 flow [2021-03-26 10:43:00,635 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 40 transitions, 391 flow [2021-03-26 10:43:00,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 40 transitions, 391 flow [2021-03-26 10:43:00,645 INFO L129 PetriNetUnfolder]: 27/109 cut-off events. [2021-03-26 10:43:00,645 INFO L130 PetriNetUnfolder]: For 566/570 co-relation queries the response was YES. [2021-03-26 10:43:00,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 109 events. 27/109 cut-off events. For 566/570 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 483 event pairs, 0 based on Foata normal form. 4/111 useless extension candidates. Maximal degree in co-relation 498. Up to 31 conditions per place. [2021-03-26 10:43:00,646 INFO L142 LiptonReduction]: Number of co-enabled transitions 142 [2021-03-26 10:43:01,520 WARN L205 SmtUtils]: Spent 872.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 156 [2021-03-26 10:43:01,777 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-03-26 10:43:03,336 WARN L205 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 312 DAG size of output: 250 [2021-03-26 10:43:03,963 WARN L205 SmtUtils]: Spent 624.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2021-03-26 10:43:03,967 INFO L154 LiptonReduction]: Checked pairs total: 5 [2021-03-26 10:43:03,967 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:43:03,967 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3332 [2021-03-26 10:43:03,967 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 40 transitions, 404 flow [2021-03-26 10:43:03,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:03,968 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:43:03,968 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:43:03,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-26 10:43:03,968 INFO L428 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:43:03,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:43:03,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2052709697, now seen corresponding path program 1 times [2021-03-26 10:43:03,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:43:03,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334407054] [2021-03-26 10:43:03,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:43:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:43:03,990 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:43:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:43:04,013 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:43:04,045 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:43:04,045 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:43:04,045 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-26 10:43:04,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:43:04 BasicIcfg [2021-03-26 10:43:04,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:43:04,120 INFO L168 Benchmark]: Toolchain (without parser) took 57928.69 ms. Allocated memory was 255.9 MB in the beginning and 1.1 GB in the end (delta: 794.8 MB). Free memory was 234.6 MB in the beginning and 869.6 MB in the end (delta: -635.0 MB). Peak memory consumption was 158.3 MB. Max. memory is 16.0 GB. [2021-03-26 10:43:04,120 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 255.9 MB. Free memory was 238.0 MB in the beginning and 238.0 MB in the end (delta: 40.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:43:04,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.27 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 234.6 MB in the beginning and 323.7 MB in the end (delta: -89.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:43:04,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.45 ms. Allocated memory is still 367.0 MB. Free memory was 323.0 MB in the beginning and 320.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:43:04,120 INFO L168 Benchmark]: Boogie Preprocessor took 24.83 ms. Allocated memory is still 367.0 MB. Free memory was 320.2 MB in the beginning and 317.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:43:04,120 INFO L168 Benchmark]: RCFGBuilder took 2004.19 ms. Allocated memory was 367.0 MB in the beginning and 457.2 MB in the end (delta: 90.2 MB). Free memory was 317.4 MB in the beginning and 411.7 MB in the end (delta: -94.2 MB). Peak memory consumption was 155.5 MB. Max. memory is 16.0 GB. [2021-03-26 10:43:04,121 INFO L168 Benchmark]: TraceAbstraction took 55405.09 ms. Allocated memory was 457.2 MB in the beginning and 1.1 GB in the end (delta: 593.5 MB). Free memory was 410.8 MB in the beginning and 869.6 MB in the end (delta: -458.8 MB). Peak memory consumption was 134.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:43:04,121 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.13 ms. Allocated memory is still 255.9 MB. Free memory was 238.0 MB in the beginning and 238.0 MB in the end (delta: 40.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 444.27 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 234.6 MB in the beginning and 323.7 MB in the end (delta: -89.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 45.45 ms. Allocated memory is still 367.0 MB. Free memory was 323.0 MB in the beginning and 320.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 24.83 ms. Allocated memory is still 367.0 MB. Free memory was 320.2 MB in the beginning and 317.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2004.19 ms. Allocated memory was 367.0 MB in the beginning and 457.2 MB in the end (delta: 90.2 MB). Free memory was 317.4 MB in the beginning and 411.7 MB in the end (delta: -94.2 MB). Peak memory consumption was 155.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 55405.09 ms. Allocated memory was 457.2 MB in the beginning and 1.1 GB in the end (delta: 593.5 MB). Free memory was 410.8 MB in the beginning and 869.6 MB in the end (delta: -458.8 MB). Peak memory consumption was 134.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5252.9ms, 102 PlacesBefore, 47 PlacesAfterwards, 94 TransitionsBefore, 38 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 6 FixpointIterations, 25 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 3146 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1442, positive: 1353, positive conditional: 1353, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1442, positive: 1353, positive conditional: 0, positive unconditional: 1353, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1442, positive: 1353, positive conditional: 0, positive unconditional: 1353, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1076, positive: 1039, positive conditional: 0, positive unconditional: 1039, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1076, positive: 1035, positive conditional: 0, positive unconditional: 1035, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 637, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 627, negative conditional: 0, negative unconditional: 627, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1442, positive: 314, positive conditional: 0, positive unconditional: 314, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 1076, unknown conditional: 0, unknown unconditional: 1076] , Statistics on independence cache: Total cache size (in pairs): 1076, Positive cache size: 1039, Positive conditional cache size: 0, Positive unconditional cache size: 1039, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4567.0ms, 44 PlacesBefore, 33 PlacesAfterwards, 35 TransitionsBefore, 24 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1174 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 444, positive: 361, positive conditional: 361, positive unconditional: 0, negative: 83, negative conditional: 83, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 444, positive: 361, positive conditional: 20, positive unconditional: 341, negative: 83, negative conditional: 4, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 444, positive: 361, positive conditional: 20, positive unconditional: 341, negative: 83, negative conditional: 4, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 97, positive: 89, positive conditional: 3, positive unconditional: 86, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 97, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 135, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 96, negative conditional: 13, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 444, positive: 272, positive conditional: 17, positive unconditional: 255, negative: 75, negative conditional: 3, negative unconditional: 72, unknown: 97, unknown conditional: 4, unknown unconditional: 93] , Statistics on independence cache: Total cache size (in pairs): 1173, Positive cache size: 1128, Positive conditional cache size: 3, Positive unconditional cache size: 1125, Negative cache size: 45, Negative conditional cache size: 1, Negative unconditional cache size: 44, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 904.3ms, 37 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 753 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 225, positive: 171, positive conditional: 171, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 225, positive: 171, positive conditional: 0, positive unconditional: 171, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 225, positive: 171, positive conditional: 0, positive unconditional: 171, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 225, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1177, Positive cache size: 1132, Positive conditional cache size: 3, Positive unconditional cache size: 1129, Negative cache size: 45, Negative conditional cache size: 1, Negative unconditional cache size: 44, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8ms, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 233 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1177, Positive cache size: 1132, Positive conditional cache size: 3, Positive unconditional cache size: 1129, Negative cache size: 45, Negative conditional cache size: 1, Negative unconditional cache size: 44, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 110.3ms, 38 PlacesBefore, 38 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, positive: 41, positive conditional: 8, positive unconditional: 33, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, positive: 41, positive conditional: 8, positive unconditional: 33, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, positive: 66, positive conditional: 66, positive unconditional: 0, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, positive: 39, positive conditional: 6, positive unconditional: 33, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1180, Positive cache size: 1134, Positive conditional cache size: 5, Positive unconditional cache size: 1129, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75.9ms, 44 PlacesBefore, 44 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 111 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, positive: 38, positive conditional: 5, positive unconditional: 33, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, positive: 38, positive conditional: 5, positive unconditional: 33, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, positive: 34, positive conditional: 3, positive unconditional: 31, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1185, Positive cache size: 1138, Positive conditional cache size: 7, Positive unconditional cache size: 1131, Negative cache size: 47, Negative conditional cache size: 1, Negative unconditional cache size: 46, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 46.5ms, 51 PlacesBefore, 51 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 202 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, positive: 110, positive conditional: 110, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, positive: 110, positive conditional: 39, positive unconditional: 71, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 118, positive: 110, positive conditional: 39, positive unconditional: 71, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 4, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, positive: 105, positive conditional: 35, positive unconditional: 70, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1190, Positive cache size: 1143, Positive conditional cache size: 11, Positive unconditional cache size: 1132, Negative cache size: 47, Negative conditional cache size: 1, Negative unconditional cache size: 46, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4521.2ms, 57 PlacesBefore, 57 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 516 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 835 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 599, positive: 575, positive conditional: 575, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 599, positive: 575, positive conditional: 335, positive unconditional: 240, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 599, positive: 575, positive conditional: 335, positive unconditional: 240, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 16, positive conditional: 14, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 341, positive: 319, positive conditional: 319, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 599, positive: 559, positive conditional: 321, positive unconditional: 238, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 17, unknown conditional: 14, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1207, Positive cache size: 1159, Positive conditional cache size: 25, Positive unconditional cache size: 1134, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 52 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 85.1ms, 66 PlacesBefore, 66 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 542 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 484 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 318, positive: 304, positive conditional: 304, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 318, positive: 304, positive conditional: 159, positive unconditional: 145, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 318, positive: 304, positive conditional: 159, positive unconditional: 145, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 318, positive: 302, positive conditional: 157, positive unconditional: 145, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1209, Positive cache size: 1161, Positive conditional cache size: 27, Positive unconditional cache size: 1134, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 112.6ms, 73 PlacesBefore, 73 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 836 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 670, positive: 644, positive conditional: 644, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 670, positive: 644, positive conditional: 366, positive unconditional: 278, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 670, positive: 644, positive conditional: 366, positive unconditional: 278, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 670, positive: 643, positive conditional: 366, positive unconditional: 277, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1210, Positive cache size: 1162, Positive conditional cache size: 27, Positive unconditional cache size: 1135, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 56 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2578.2ms, 78 PlacesBefore, 78 PlacesAfterwards, 120 TransitionsBefore, 119 TransitionsAfterwards, 716 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 4837 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4127, positive: 4041, positive conditional: 4041, positive unconditional: 0, negative: 86, negative conditional: 86, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4127, positive: 4041, positive conditional: 2899, positive unconditional: 1142, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4127, positive: 4041, positive conditional: 2899, positive unconditional: 1142, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 2, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4127, positive: 4036, positive conditional: 2897, positive unconditional: 1139, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1215, Positive cache size: 1167, Positive conditional cache size: 29, Positive unconditional cache size: 1138, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 368 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 124.1ms, 81 PlacesBefore, 81 PlacesAfterwards, 125 TransitionsBefore, 125 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2565 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2253, positive: 2207, positive conditional: 2207, positive unconditional: 0, negative: 46, negative conditional: 46, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2253, positive: 2207, positive conditional: 1626, positive unconditional: 581, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2253, positive: 2207, positive conditional: 1626, positive unconditional: 581, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2253, positive: 2205, positive conditional: 1624, positive unconditional: 581, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1217, Positive cache size: 1169, Positive conditional cache size: 31, Positive unconditional cache size: 1138, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 170 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 122.6ms, 89 PlacesBefore, 89 PlacesAfterwards, 132 TransitionsBefore, 132 TransitionsAfterwards, 764 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2924 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2523, positive: 2473, positive conditional: 2473, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2523, positive: 2473, positive conditional: 1859, positive unconditional: 614, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2523, positive: 2473, positive conditional: 1859, positive unconditional: 614, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2523, positive: 2473, positive conditional: 1859, positive unconditional: 614, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1217, Positive cache size: 1169, Positive conditional cache size: 31, Positive unconditional cache size: 1138, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 179 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4536.2ms, 90 PlacesBefore, 87 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2118 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1667, positive: 1601, positive conditional: 1601, positive unconditional: 0, negative: 66, negative conditional: 66, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1667, positive: 1601, positive conditional: 1048, positive unconditional: 553, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1667, positive: 1601, positive conditional: 1048, positive unconditional: 553, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1667, positive: 1598, positive conditional: 1045, positive unconditional: 553, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1220, Positive cache size: 1172, Positive conditional cache size: 34, Positive unconditional cache size: 1138, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 143 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 139.7ms, 92 PlacesBefore, 92 PlacesAfterwards, 107 TransitionsBefore, 107 TransitionsAfterwards, 596 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1608 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1293, positive: 1249, positive conditional: 1249, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1293, positive: 1249, positive conditional: 841, positive unconditional: 408, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1293, positive: 1249, positive conditional: 841, positive unconditional: 408, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 1, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1293, positive: 1246, positive conditional: 840, positive unconditional: 406, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1223, Positive cache size: 1175, Positive conditional cache size: 35, Positive unconditional cache size: 1140, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 124 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 151.7ms, 104 PlacesBefore, 103 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1831 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1454, positive: 1407, positive conditional: 1407, positive unconditional: 0, negative: 47, negative conditional: 47, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1454, positive: 1407, positive conditional: 920, positive unconditional: 487, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1454, positive: 1407, positive conditional: 920, positive unconditional: 487, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1454, positive: 1406, positive conditional: 919, positive unconditional: 487, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1224, Positive cache size: 1176, Positive conditional cache size: 36, Positive unconditional cache size: 1140, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 189 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 899.6ms, 112 PlacesBefore, 112 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 676 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 4103 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3281, positive: 3181, positive conditional: 3181, positive unconditional: 0, negative: 100, negative conditional: 100, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3281, positive: 3181, positive conditional: 2086, positive unconditional: 1095, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3281, positive: 3181, positive conditional: 2086, positive unconditional: 1095, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3281, positive: 3181, positive conditional: 2086, positive unconditional: 1095, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1224, Positive cache size: 1176, Positive conditional cache size: 36, Positive unconditional cache size: 1140, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 471 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2809.4ms, 116 PlacesBefore, 116 PlacesAfterwards, 121 TransitionsBefore, 121 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3806 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2973, positive: 2879, positive conditional: 2879, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2973, positive: 2879, positive conditional: 1904, positive unconditional: 975, negative: 94, negative conditional: 0, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2973, positive: 2879, positive conditional: 1904, positive unconditional: 975, negative: 94, negative conditional: 0, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 4, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, positive: 76, positive conditional: 76, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2973, positive: 2871, positive conditional: 1900, positive unconditional: 971, negative: 94, negative conditional: 0, negative unconditional: 94, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1232, Positive cache size: 1184, Positive conditional cache size: 40, Positive unconditional cache size: 1144, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 391 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10910.2ms, 101 PlacesBefore, 101 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 20 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, positive: 20, positive conditional: 6, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 6, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, positive: 16, positive conditional: 4, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1236, Positive cache size: 1188, Positive conditional cache size: 42, Positive unconditional cache size: 1146, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 61.0ms, 98 PlacesBefore, 98 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 670 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1236, Positive cache size: 1188, Positive conditional cache size: 42, Positive unconditional cache size: 1146, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5261.9ms, 102 PlacesBefore, 99 PlacesAfterwards, 68 TransitionsBefore, 64 TransitionsAfterwards, 476 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 83 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, positive: 83, positive conditional: 83, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, positive: 83, positive conditional: 78, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 83, positive: 83, positive conditional: 78, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 15, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 83, positive: 66, positive conditional: 63, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 17, unknown conditional: 15, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1253, Positive cache size: 1205, Positive conditional cache size: 57, Positive unconditional cache size: 1148, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.3ms, 86 PlacesBefore, 85 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1253, Positive cache size: 1205, Positive conditional cache size: 57, Positive unconditional cache size: 1148, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.4ms, 83 PlacesBefore, 79 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1253, Positive cache size: 1205, Positive conditional cache size: 57, Positive unconditional cache size: 1148, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.6ms, 79 PlacesBefore, 77 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1253, Positive cache size: 1205, Positive conditional cache size: 57, Positive unconditional cache size: 1148, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3332.2ms, 81 PlacesBefore, 75 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 5 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 5, positive: 2, positive conditional: 2, 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): 1256, Positive cache size: 1208, Positive conditional cache size: 60, Positive unconditional cache size: 1148, Negative cache size: 48, Negative conditional cache size: 1, Negative unconditional cache size: 47, Eliminated conditions: 0 - CounterExampleResult [Line: 19]: 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; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2546; [L850] FCALL, FORK 0 pthread_create(&t2546, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2547; [L852] FCALL, FORK 0 pthread_create(&t2547, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2548; [L854] FCALL, FORK 0 pthread_create(&t2548, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=60, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=60, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=62, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 55199.4ms, OverallIterations: 25, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 5396.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5318.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 101 SDtfs, 108 SDslu, 49 SDs, 0 SdLazy, 1091 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1524.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2200.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2075occurred in iteration=17, InterpolantAutomatonStates: 163, 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: 65.6ms SsaConstructionTime, 610.6ms SatisfiabilityAnalysisTime, 2102.3ms InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 353 ConstructedInterpolants, 0 QuantifiedInterpolants, 3423 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...