/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/mix056_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:15:04,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:15:04,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:15:04,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:15:04,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:15:04,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:15:04,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:15:04,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:15:04,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:15:04,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:15:04,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:15:04,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:15:04,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:15:04,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:15:04,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:15:04,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:15:04,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:15:04,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:15:04,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:15:04,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:15:04,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:15:04,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:15:04,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:15:04,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:15:04,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:15:04,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:15:04,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:15:04,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:15:04,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:15:04,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:15:04,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:15:04,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:15:04,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:15:04,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:15:04,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:15:04,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:15:04,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:15:04,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:15:04,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:15:04,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:15:04,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:15:04,536 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:15:04,570 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:15:04,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:15:04,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:15:04,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:15:04,574 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:15:04,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:15:04,574 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:15:04,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:15:04,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:15:04,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:15:04,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:15:04,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:15:04,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:15:04,576 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:15:04,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:15:04,577 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:15:04,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:15:04,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:15:04,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:15:04,577 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:15:04,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:15:04,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:15:04,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:15:04,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:15:04,578 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:15:04,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:15:04,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:15:04,579 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:15:04,579 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:15:04,579 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:15:04,580 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:15:04,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:15:04,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:15:04,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:15:04,909 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:15:04,912 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:15:04,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i [2021-03-26 10:15:04,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00ca5c21/e9c0becf7cd44c389b067a692812699c/FLAG6747ff401 [2021-03-26 10:15:05,380 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:15:05,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i [2021-03-26 10:15:05,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00ca5c21/e9c0becf7cd44c389b067a692812699c/FLAG6747ff401 [2021-03-26 10:15:05,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00ca5c21/e9c0becf7cd44c389b067a692812699c [2021-03-26 10:15:05,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:15:05,418 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:15:05,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:15:05,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:15:05,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:15:05,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:15:05" (1/1) ... [2021-03-26 10:15:05,423 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:15:05, skipping insertion in model container [2021-03-26 10:15:05,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:15:05" (1/1) ... [2021-03-26 10:15:05,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:15:05,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:15:05,638 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/mix056_tso.opt.i[948,961] [2021-03-26 10:15:05,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:15:05,846 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:15:05,857 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/mix056_tso.opt.i[948,961] [2021-03-26 10:15:05,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:15:05,977 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:15:05,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:05 WrapperNode [2021-03-26 10:15:05,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:15:05,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:15:05,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:15:05,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:15:05,986 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:15:05" (1/1) ... [2021-03-26 10:15:06,003 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:15:05" (1/1) ... [2021-03-26 10:15:06,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:15:06,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:15:06,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:15:06,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:15:06,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:05" (1/1) ... [2021-03-26 10:15:06,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:05" (1/1) ... [2021-03-26 10:15:06,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:05" (1/1) ... [2021-03-26 10:15:06,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:05" (1/1) ... [2021-03-26 10:15:06,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:05" (1/1) ... [2021-03-26 10:15:06,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:05" (1/1) ... [2021-03-26 10:15:06,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:05" (1/1) ... [2021-03-26 10:15:06,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:15:06,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:15:06,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:15:06,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:15:06,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:05" (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:15:06,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:15:06,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:15:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:15:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:15:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:15:06,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:15:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:15:06,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:15:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:15:06,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:15:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:15:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:15:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:15:06,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:15:06,145 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:15:07,738 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:15:07,739 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:15:07,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:15:07 BoogieIcfgContainer [2021-03-26 10:15:07,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:15:07,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:15:07,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:15:07,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:15:07,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:15:05" (1/3) ... [2021-03-26 10:15:07,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ee87cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:15:07, skipping insertion in model container [2021-03-26 10:15:07,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:05" (2/3) ... [2021-03-26 10:15:07,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ee87cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:15:07, skipping insertion in model container [2021-03-26 10:15:07,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:15:07" (3/3) ... [2021-03-26 10:15:07,748 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_tso.opt.i [2021-03-26 10:15:07,755 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:15:07,759 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:15:07,760 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:15:07,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,791 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,792 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,792 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,792 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,793 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,793 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,793 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,793 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,798 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,798 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,798 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,798 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,798 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,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:15:07,799 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,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:15:07,799 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,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:15:07,799 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,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:15:07,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,805 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,805 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,808 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,808 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,811 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:07,814 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:15:07,832 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:15:07,860 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:15:07,860 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:15:07,861 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:15:07,865 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:15:07,865 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:15:07,866 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:15:07,866 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:15:07,866 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:15:07,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2021-03-26 10:15:07,923 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-26 10:15:07,923 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:07,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-26 10:15:07,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2021-03-26 10:15:07,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2021-03-26 10:15:07,941 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:07,953 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-26 10:15:07,955 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-26 10:15:07,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 195 flow [2021-03-26 10:15:07,993 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-26 10:15:07,993 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:07,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-26 10:15:07,998 INFO L142 LiptonReduction]: Number of co-enabled transitions 1578 [2021-03-26 10:15:09,847 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-03-26 10:15:10,167 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-26 10:15:11,708 WARN L205 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 310 DAG size of output: 265 [2021-03-26 10:15:12,249 WARN L205 SmtUtils]: Spent 533.00 ms on a formula simplification that was a NOOP. DAG size: 262 [2021-03-26 10:15:12,792 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:15:13,153 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 10:15:13,272 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:15:14,505 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:15:14,813 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:15:15,416 WARN L205 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:15:16,145 WARN L205 SmtUtils]: Spent 727.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:15:16,376 INFO L154 LiptonReduction]: Checked pairs total: 2725 [2021-03-26 10:15:16,376 INFO L156 LiptonReduction]: Total number of compositions: 68 [2021-03-26 10:15:16,378 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8438 [2021-03-26 10:15:16,388 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:15:16,388 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:16,388 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:16,389 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:15:16,389 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:15:16,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:16,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1719955494, now seen corresponding path program 1 times [2021-03-26 10:15:16,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:16,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869917685] [2021-03-26 10:15:16,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:16,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:16,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:16,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:16,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:16,681 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:15:16,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869917685] [2021-03-26 10:15:16,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:16,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:15:16,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313773291] [2021-03-26 10:15:16,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:15:16,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:16,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:15:16,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:15:16,709 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 164 [2021-03-26 10:15:16,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have 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:15:16,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:16,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 164 [2021-03-26 10:15:16,716 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:16,797 INFO L129 PetriNetUnfolder]: 23/90 cut-off events. [2021-03-26 10:15:16,797 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:16,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 90 events. 23/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 305 event pairs, 3 based on Foata normal form. 5/87 useless extension candidates. Maximal degree in co-relation 129. Up to 37 conditions per place. [2021-03-26 10:15:16,799 INFO L132 encePairwiseOnDemand]: 160/164 looper letters, 7 selfloop transitions, 2 changer transitions 3/37 dead transitions. [2021-03-26 10:15:16,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 105 flow [2021-03-26 10:15:16,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:16,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2021-03-26 10:15:16,820 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8882113821138211 [2021-03-26 10:15:16,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2021-03-26 10:15:16,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2021-03-26 10:15:16,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:16,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2021-03-26 10:15:16,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have 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:15:16,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have 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:15:16,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have 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:15:16,848 INFO L185 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 437 transitions. [2021-03-26 10:15:16,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 105 flow [2021-03-26 10:15:16,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:15:16,852 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 72 flow [2021-03-26 10:15:16,854 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-03-26 10:15:16,855 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2021-03-26 10:15:16,855 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:16,855 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 72 flow [2021-03-26 10:15:16,856 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 72 flow [2021-03-26 10:15:16,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 72 flow [2021-03-26 10:15:16,861 INFO L129 PetriNetUnfolder]: 0/31 cut-off events. [2021-03-26 10:15:16,861 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:16,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:15:16,862 INFO L142 LiptonReduction]: Number of co-enabled transitions 230 [2021-03-26 10:15:17,451 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:15:17,818 WARN L205 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:15:18,484 WARN L205 SmtUtils]: Spent 664.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:15:19,078 WARN L205 SmtUtils]: Spent 592.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:15:20,007 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-03-26 10:15:20,193 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-03-26 10:15:20,267 INFO L154 LiptonReduction]: Checked pairs total: 1024 [2021-03-26 10:15:20,268 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-26 10:15:20,268 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3413 [2021-03-26 10:15:20,270 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2021-03-26 10:15:20,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have 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:15:20,270 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:20,270 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:20,271 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:15:20,271 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:15:20,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:20,278 INFO L82 PathProgramCache]: Analyzing trace with hash 236066665, now seen corresponding path program 1 times [2021-03-26 10:15:20,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:20,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164426808] [2021-03-26 10:15:20,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:20,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:20,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:20,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:20,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:20,421 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:15:20,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:15:20,425 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:15:20,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164426808] [2021-03-26 10:15:20,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:20,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:15:20,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225487810] [2021-03-26 10:15:20,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:15:20,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:20,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:15:20,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:15:20,428 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 173 [2021-03-26 10:15:20,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:20,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:20,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 173 [2021-03-26 10:15:20,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:20,448 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-26 10:15:20,448 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:20,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 34 events. 3/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 1 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-03-26 10:15:20,449 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 3 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2021-03-26 10:15:20,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 24 transitions, 70 flow [2021-03-26 10:15:20,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2021-03-26 10:15:20,451 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8631984585741811 [2021-03-26 10:15:20,451 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2021-03-26 10:15:20,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2021-03-26 10:15:20,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:20,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2021-03-26 10:15:20,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have 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:15:20,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have 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:15:20,454 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have 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:15:20,454 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 448 transitions. [2021-03-26 10:15:20,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 24 transitions, 70 flow [2021-03-26 10:15:20,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 24 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:15:20,455 INFO L241 Difference]: Finished difference. Result has 32 places, 24 transitions, 69 flow [2021-03-26 10:15:20,455 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2021-03-26 10:15:20,456 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -13 predicate places. [2021-03-26 10:15:20,456 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:20,456 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 24 transitions, 69 flow [2021-03-26 10:15:20,456 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 24 transitions, 69 flow [2021-03-26 10:15:20,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 24 transitions, 69 flow [2021-03-26 10:15:20,463 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-26 10:15:20,464 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:20,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 34 events. 3/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 46. Up to 10 conditions per place. [2021-03-26 10:15:20,464 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-26 10:15:20,795 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:15:20,931 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:15:21,230 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:15:21,376 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:15:21,379 INFO L154 LiptonReduction]: Checked pairs total: 440 [2021-03-26 10:15:21,379 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:15:21,379 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 923 [2021-03-26 10:15:21,380 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 67 flow [2021-03-26 10:15:21,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:21,381 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:21,381 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:21,381 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:15:21,381 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:15:21,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:21,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2078982232, now seen corresponding path program 1 times [2021-03-26 10:15:21,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:21,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199588987] [2021-03-26 10:15:21,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:21,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:21,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:15:21,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:21,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:15:21,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:21,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:15:21,517 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:15:21,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199588987] [2021-03-26 10:15:21,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:21,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:15:21,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202129416] [2021-03-26 10:15:21,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:15:21,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:21,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:15:21,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:15:21,520 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 174 [2021-03-26 10:15:21,520 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have 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:15:21,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:21,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 174 [2021-03-26 10:15:21,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:21,587 INFO L129 PetriNetUnfolder]: 66/150 cut-off events. [2021-03-26 10:15:21,587 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-03-26 10:15:21,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 150 events. 66/150 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 615 event pairs, 34 based on Foata normal form. 1/137 useless extension candidates. Maximal degree in co-relation 292. Up to 101 conditions per place. [2021-03-26 10:15:21,591 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 7 selfloop transitions, 7 changer transitions 0/30 dead transitions. [2021-03-26 10:15:21,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 111 flow [2021-03-26 10:15:21,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:15:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:15:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2021-03-26 10:15:21,595 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7744252873563219 [2021-03-26 10:15:21,595 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2021-03-26 10:15:21,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2021-03-26 10:15:21,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:21,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2021-03-26 10:15:21,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have 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:15:21,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:21,598 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:21,598 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 67 flow. Second operand 4 states and 539 transitions. [2021-03-26 10:15:21,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 111 flow [2021-03-26 10:15:21,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:21,600 INFO L241 Difference]: Finished difference. Result has 35 places, 29 transitions, 112 flow [2021-03-26 10:15:21,600 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, 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=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2021-03-26 10:15:21,601 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -10 predicate places. [2021-03-26 10:15:21,601 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:21,601 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 112 flow [2021-03-26 10:15:21,602 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 112 flow [2021-03-26 10:15:21,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 112 flow [2021-03-26 10:15:21,617 INFO L129 PetriNetUnfolder]: 32/95 cut-off events. [2021-03-26 10:15:21,617 INFO L130 PetriNetUnfolder]: For 29/33 co-relation queries the response was YES. [2021-03-26 10:15:21,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 95 events. 32/95 cut-off events. For 29/33 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 354 event pairs, 9 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 201. Up to 38 conditions per place. [2021-03-26 10:15:21,620 INFO L142 LiptonReduction]: Number of co-enabled transitions 300 [2021-03-26 10:15:21,623 INFO L154 LiptonReduction]: Checked pairs total: 176 [2021-03-26 10:15:21,623 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:21,624 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-26 10:15:21,627 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 112 flow [2021-03-26 10:15:21,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have 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:15:21,627 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:21,628 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:21,628 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:15:21,628 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:15:21,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:21,628 INFO L82 PathProgramCache]: Analyzing trace with hash 197787498, now seen corresponding path program 1 times [2021-03-26 10:15:21,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:21,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156806141] [2021-03-26 10:15:21,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:21,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:21,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:15:21,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:21,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:15:21,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:21,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:15:21,809 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:15:21,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156806141] [2021-03-26 10:15:21,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:21,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:15:21,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199405959] [2021-03-26 10:15:21,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:15:21,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:21,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:15:21,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:15:21,813 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 174 [2021-03-26 10:15:21,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have 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:15:21,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:21,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 174 [2021-03-26 10:15:21,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:21,881 INFO L129 PetriNetUnfolder]: 57/139 cut-off events. [2021-03-26 10:15:21,881 INFO L130 PetriNetUnfolder]: For 90/92 co-relation queries the response was YES. [2021-03-26 10:15:21,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 139 events. 57/139 cut-off events. For 90/92 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 582 event pairs, 23 based on Foata normal form. 4/133 useless extension candidates. Maximal degree in co-relation 364. Up to 90 conditions per place. [2021-03-26 10:15:21,883 INFO L132 encePairwiseOnDemand]: 169/174 looper letters, 8 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2021-03-26 10:15:21,883 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 147 flow [2021-03-26 10:15:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:15:21,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:15:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2021-03-26 10:15:21,885 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7729885057471264 [2021-03-26 10:15:21,885 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2021-03-26 10:15:21,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2021-03-26 10:15:21,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:21,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2021-03-26 10:15:21,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have 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:15:21,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:21,889 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:21,889 INFO L185 Difference]: Start difference. First operand has 35 places, 29 transitions, 112 flow. Second operand 4 states and 538 transitions. [2021-03-26 10:15:21,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 147 flow [2021-03-26 10:15:21,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 147 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:15:21,891 INFO L241 Difference]: Finished difference. Result has 39 places, 30 transitions, 138 flow [2021-03-26 10:15:21,891 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2021-03-26 10:15:21,891 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2021-03-26 10:15:21,891 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:21,892 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 30 transitions, 138 flow [2021-03-26 10:15:21,892 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 138 flow [2021-03-26 10:15:21,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 138 flow [2021-03-26 10:15:21,902 INFO L129 PetriNetUnfolder]: 26/84 cut-off events. [2021-03-26 10:15:21,903 INFO L130 PetriNetUnfolder]: For 66/72 co-relation queries the response was YES. [2021-03-26 10:15:21,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 84 events. 26/84 cut-off events. For 66/72 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 317 event pairs, 7 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 220. Up to 35 conditions per place. [2021-03-26 10:15:21,904 INFO L142 LiptonReduction]: Number of co-enabled transitions 302 [2021-03-26 10:15:21,907 INFO L154 LiptonReduction]: Checked pairs total: 202 [2021-03-26 10:15:21,907 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:21,907 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-26 10:15:21,910 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 138 flow [2021-03-26 10:15:21,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have 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:15:21,911 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:21,911 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:21,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:15:21,911 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:15:21,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:21,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1030081067, now seen corresponding path program 1 times [2021-03-26 10:15:21,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:21,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690395726] [2021-03-26 10:15:21,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:21,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:21,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:15:22,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:15:22,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:15:22,014 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:15:22,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690395726] [2021-03-26 10:15:22,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:22,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:15:22,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627389577] [2021-03-26 10:15:22,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:15:22,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:22,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:15:22,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:15:22,017 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 174 [2021-03-26 10:15:22,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have 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:15:22,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:22,018 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 174 [2021-03-26 10:15:22,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:22,070 INFO L129 PetriNetUnfolder]: 49/133 cut-off events. [2021-03-26 10:15:22,070 INFO L130 PetriNetUnfolder]: For 177/179 co-relation queries the response was YES. [2021-03-26 10:15:22,071 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 133 events. 49/133 cut-off events. For 177/179 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 590 event pairs, 12 based on Foata normal form. 8/131 useless extension candidates. Maximal degree in co-relation 389. Up to 64 conditions per place. [2021-03-26 10:15:22,071 INFO L132 encePairwiseOnDemand]: 169/174 looper letters, 11 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2021-03-26 10:15:22,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 190 flow [2021-03-26 10:15:22,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:15:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:15:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2021-03-26 10:15:22,074 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8045977011494253 [2021-03-26 10:15:22,074 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2021-03-26 10:15:22,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2021-03-26 10:15:22,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:22,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2021-03-26 10:15:22,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have 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:15:22,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:22,078 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:22,078 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 138 flow. Second operand 4 states and 560 transitions. [2021-03-26 10:15:22,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 190 flow [2021-03-26 10:15:22,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 181 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:15:22,082 INFO L241 Difference]: Finished difference. Result has 41 places, 32 transitions, 163 flow [2021-03-26 10:15:22,082 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2021-03-26 10:15:22,082 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2021-03-26 10:15:22,083 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:22,083 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 163 flow [2021-03-26 10:15:22,083 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 163 flow [2021-03-26 10:15:22,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 163 flow [2021-03-26 10:15:22,098 INFO L129 PetriNetUnfolder]: 35/109 cut-off events. [2021-03-26 10:15:22,099 INFO L130 PetriNetUnfolder]: For 194/202 co-relation queries the response was YES. [2021-03-26 10:15:22,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 109 events. 35/109 cut-off events. For 194/202 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 456 event pairs, 8 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 336. Up to 45 conditions per place. [2021-03-26 10:15:22,100 INFO L142 LiptonReduction]: Number of co-enabled transitions 322 [2021-03-26 10:15:22,107 INFO L154 LiptonReduction]: Checked pairs total: 191 [2021-03-26 10:15:22,108 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:22,108 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-26 10:15:22,110 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 163 flow [2021-03-26 10:15:22,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have 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:15:22,111 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:22,111 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:22,111 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:15:22,111 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:15:22,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:22,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1839911596, now seen corresponding path program 1 times [2021-03-26 10:15:22,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:22,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341072975] [2021-03-26 10:15:22,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:22,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:15:22,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:15:22,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:15:22,230 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:15:22,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341072975] [2021-03-26 10:15:22,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:22,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:15:22,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908919590] [2021-03-26 10:15:22,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:15:22,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:22,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:15:22,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:15:22,235 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 174 [2021-03-26 10:15:22,237 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have 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:15:22,237 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:22,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 174 [2021-03-26 10:15:22,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:22,308 INFO L129 PetriNetUnfolder]: 48/132 cut-off events. [2021-03-26 10:15:22,308 INFO L130 PetriNetUnfolder]: For 233/239 co-relation queries the response was YES. [2021-03-26 10:15:22,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 132 events. 48/132 cut-off events. For 233/239 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 565 event pairs, 5 based on Foata normal form. 7/129 useless extension candidates. Maximal degree in co-relation 443. Up to 75 conditions per place. [2021-03-26 10:15:22,310 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 14 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2021-03-26 10:15:22,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 227 flow [2021-03-26 10:15:22,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:15:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:15:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2021-03-26 10:15:22,313 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7959770114942529 [2021-03-26 10:15:22,313 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2021-03-26 10:15:22,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2021-03-26 10:15:22,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:22,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2021-03-26 10:15:22,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have 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:15:22,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:22,316 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:22,316 INFO L185 Difference]: Start difference. First operand has 41 places, 32 transitions, 163 flow. Second operand 4 states and 554 transitions. [2021-03-26 10:15:22,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 227 flow [2021-03-26 10:15:22,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 215 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:15:22,321 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 195 flow [2021-03-26 10:15:22,321 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2021-03-26 10:15:22,321 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2021-03-26 10:15:22,321 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:22,322 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 195 flow [2021-03-26 10:15:22,322 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 195 flow [2021-03-26 10:15:22,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 195 flow [2021-03-26 10:15:22,345 INFO L129 PetriNetUnfolder]: 44/124 cut-off events. [2021-03-26 10:15:22,345 INFO L130 PetriNetUnfolder]: For 195/196 co-relation queries the response was YES. [2021-03-26 10:15:22,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 124 events. 44/124 cut-off events. For 195/196 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 549 event pairs, 12 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 393. Up to 42 conditions per place. [2021-03-26 10:15:22,347 INFO L142 LiptonReduction]: Number of co-enabled transitions 344 [2021-03-26 10:15:22,354 INFO L154 LiptonReduction]: Checked pairs total: 255 [2021-03-26 10:15:22,354 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:22,354 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-26 10:15:22,355 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 195 flow [2021-03-26 10:15:22,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have 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:15:22,356 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:22,356 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:22,356 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:15:22,356 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:15:22,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:22,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1202684383, now seen corresponding path program 1 times [2021-03-26 10:15:22,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:22,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812597894] [2021-03-26 10:15:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:22,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:15:22,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:15:22,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:15:22,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:15:22,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:15:22,493 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:15:22,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812597894] [2021-03-26 10:15:22,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:22,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:15:22,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488549486] [2021-03-26 10:15:22,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:15:22,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:22,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:15:22,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:15:22,496 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 174 [2021-03-26 10:15:22,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have 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:15:22,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:22,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 174 [2021-03-26 10:15:22,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:22,588 INFO L129 PetriNetUnfolder]: 50/142 cut-off events. [2021-03-26 10:15:22,588 INFO L130 PetriNetUnfolder]: For 284/300 co-relation queries the response was YES. [2021-03-26 10:15:22,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 142 events. 50/142 cut-off events. For 284/300 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 658 event pairs, 3 based on Foata normal form. 12/144 useless extension candidates. Maximal degree in co-relation 530. Up to 58 conditions per place. [2021-03-26 10:15:22,591 INFO L132 encePairwiseOnDemand]: 167/174 looper letters, 12 selfloop transitions, 12 changer transitions 0/40 dead transitions. [2021-03-26 10:15:22,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 275 flow [2021-03-26 10:15:22,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:15:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:15:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2021-03-26 10:15:22,594 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7620689655172413 [2021-03-26 10:15:22,594 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2021-03-26 10:15:22,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2021-03-26 10:15:22,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:22,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2021-03-26 10:15:22,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have 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:15:22,597 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:15:22,597 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:15:22,598 INFO L185 Difference]: Start difference. First operand has 44 places, 35 transitions, 195 flow. Second operand 5 states and 663 transitions. [2021-03-26 10:15:22,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 275 flow [2021-03-26 10:15:22,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 267 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:22,601 INFO L241 Difference]: Finished difference. Result has 48 places, 37 transitions, 239 flow [2021-03-26 10:15:22,601 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2021-03-26 10:15:22,601 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2021-03-26 10:15:22,601 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:22,601 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 37 transitions, 239 flow [2021-03-26 10:15:22,601 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 37 transitions, 239 flow [2021-03-26 10:15:22,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 239 flow [2021-03-26 10:15:22,618 INFO L129 PetriNetUnfolder]: 44/132 cut-off events. [2021-03-26 10:15:22,618 INFO L130 PetriNetUnfolder]: For 306/307 co-relation queries the response was YES. [2021-03-26 10:15:22,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 132 events. 44/132 cut-off events. For 306/307 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 614 event pairs, 12 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 470. Up to 46 conditions per place. [2021-03-26 10:15:22,620 INFO L142 LiptonReduction]: Number of co-enabled transitions 364 [2021-03-26 10:15:22,626 INFO L154 LiptonReduction]: Checked pairs total: 311 [2021-03-26 10:15:22,626 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:22,627 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-26 10:15:22,627 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 239 flow [2021-03-26 10:15:22,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have 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:15:22,628 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:22,628 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:22,628 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:15:22,628 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:15:22,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:22,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1202730883, now seen corresponding path program 2 times [2021-03-26 10:15:22,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:22,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080886901] [2021-03-26 10:15:22,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:22,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:15:22,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:15:22,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:15:22,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:15:22,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:15:22,740 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:15:22,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080886901] [2021-03-26 10:15:22,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:22,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:15:22,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712117739] [2021-03-26 10:15:22,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:15:22,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:22,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:15:22,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:15:22,743 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 174 [2021-03-26 10:15:22,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have 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:15:22,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:22,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 174 [2021-03-26 10:15:22,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:22,819 INFO L129 PetriNetUnfolder]: 58/160 cut-off events. [2021-03-26 10:15:22,820 INFO L130 PetriNetUnfolder]: For 436/446 co-relation queries the response was YES. [2021-03-26 10:15:22,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 160 events. 58/160 cut-off events. For 436/446 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 755 event pairs, 3 based on Foata normal form. 8/158 useless extension candidates. Maximal degree in co-relation 677. Up to 89 conditions per place. [2021-03-26 10:15:22,822 INFO L132 encePairwiseOnDemand]: 167/174 looper letters, 17 selfloop transitions, 10 changer transitions 0/43 dead transitions. [2021-03-26 10:15:22,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 341 flow [2021-03-26 10:15:22,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:15:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:15:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions. [2021-03-26 10:15:22,824 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7436781609195402 [2021-03-26 10:15:22,824 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions. [2021-03-26 10:15:22,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions. [2021-03-26 10:15:22,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:22,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions. [2021-03-26 10:15:22,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have 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:15:22,828 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:15:22,828 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:15:22,828 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 239 flow. Second operand 5 states and 647 transitions. [2021-03-26 10:15:22,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 341 flow [2021-03-26 10:15:22,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 321 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:15:22,832 INFO L241 Difference]: Finished difference. Result has 50 places, 40 transitions, 277 flow [2021-03-26 10:15:22,832 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2021-03-26 10:15:22,832 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2021-03-26 10:15:22,832 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:22,833 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 40 transitions, 277 flow [2021-03-26 10:15:22,833 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 40 transitions, 277 flow [2021-03-26 10:15:22,833 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 277 flow [2021-03-26 10:15:22,851 INFO L129 PetriNetUnfolder]: 53/159 cut-off events. [2021-03-26 10:15:22,851 INFO L130 PetriNetUnfolder]: For 400/405 co-relation queries the response was YES. [2021-03-26 10:15:22,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 159 events. 53/159 cut-off events. For 400/405 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 778 event pairs, 11 based on Foata normal form. 4/154 useless extension candidates. Maximal degree in co-relation 591. Up to 58 conditions per place. [2021-03-26 10:15:22,854 INFO L142 LiptonReduction]: Number of co-enabled transitions 396 [2021-03-26 10:15:23,112 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:15:23,542 WARN L205 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-26 10:15:23,688 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-26 10:15:23,706 INFO L154 LiptonReduction]: Checked pairs total: 786 [2021-03-26 10:15:23,706 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:15:23,707 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 875 [2021-03-26 10:15:23,707 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 280 flow [2021-03-26 10:15:23,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have 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:15:23,708 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:23,708 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:23,708 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:15:23,708 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:15:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:23,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1698787041, now seen corresponding path program 3 times [2021-03-26 10:15:23,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:23,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789574936] [2021-03-26 10:15:23,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:23,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:23,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:15:23,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:23,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:15:23,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:23,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:15:23,808 INFO L142 QuantifierPusher]: treesize reduction 5, result has 85.7 percent of original size [2021-03-26 10:15:23,810 INFO L147 QuantifierPusher]: treesize reduction 4, result has 86.7 percent of original size 26 [2021-03-26 10:15:23,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:23,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:15:23,878 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:15:23,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789574936] [2021-03-26 10:15:23,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:23,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:15:23,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98491903] [2021-03-26 10:15:23,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:15:23,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:23,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:15:23,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:15:23,880 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 175 [2021-03-26 10:15:23,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 125.85714285714286) internal successors, (881), 7 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have 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:15:23,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:23,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 175 [2021-03-26 10:15:23,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:24,031 INFO L129 PetriNetUnfolder]: 60/172 cut-off events. [2021-03-26 10:15:24,032 INFO L130 PetriNetUnfolder]: For 561/583 co-relation queries the response was YES. [2021-03-26 10:15:24,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 172 events. 60/172 cut-off events. For 561/583 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 870 event pairs, 3 based on Foata normal form. 7/165 useless extension candidates. Maximal degree in co-relation 766. Up to 70 conditions per place. [2021-03-26 10:15:24,034 INFO L132 encePairwiseOnDemand]: 168/175 looper letters, 15 selfloop transitions, 16 changer transitions 0/47 dead transitions. [2021-03-26 10:15:24,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 405 flow [2021-03-26 10:15:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:15:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:15:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 898 transitions. [2021-03-26 10:15:24,037 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7330612244897959 [2021-03-26 10:15:24,037 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 898 transitions. [2021-03-26 10:15:24,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 898 transitions. [2021-03-26 10:15:24,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:24,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 898 transitions. [2021-03-26 10:15:24,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have 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:15:24,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:24,041 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:24,041 INFO L185 Difference]: Start difference. First operand has 50 places, 40 transitions, 280 flow. Second operand 7 states and 898 transitions. [2021-03-26 10:15:24,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 405 flow [2021-03-26 10:15:24,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 374 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-26 10:15:24,046 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 321 flow [2021-03-26 10:15:24,046 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=321, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-03-26 10:15:24,047 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2021-03-26 10:15:24,047 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:24,047 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 321 flow [2021-03-26 10:15:24,047 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 321 flow [2021-03-26 10:15:24,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 321 flow [2021-03-26 10:15:24,067 INFO L129 PetriNetUnfolder]: 56/166 cut-off events. [2021-03-26 10:15:24,068 INFO L130 PetriNetUnfolder]: For 536/537 co-relation queries the response was YES. [2021-03-26 10:15:24,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 166 events. 56/166 cut-off events. For 536/537 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 843 event pairs, 13 based on Foata normal form. 1/156 useless extension candidates. Maximal degree in co-relation 649. Up to 60 conditions per place. [2021-03-26 10:15:24,070 INFO L142 LiptonReduction]: Number of co-enabled transitions 422 [2021-03-26 10:15:24,081 INFO L154 LiptonReduction]: Checked pairs total: 426 [2021-03-26 10:15:24,081 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:24,081 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34 [2021-03-26 10:15:24,081 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 321 flow [2021-03-26 10:15:24,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 125.85714285714286) internal successors, (881), 7 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have 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:15:24,082 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:24,082 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:24,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:15:24,082 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:15:24,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:24,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1698621501, now seen corresponding path program 4 times [2021-03-26 10:15:24,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:24,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615491979] [2021-03-26 10:15:24,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:24,160 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-26 10:15:24,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 10:15:24,182 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 10:15:24,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 10:15:24,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:15:24,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:15:24,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:15:24,237 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:15:24,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615491979] [2021-03-26 10:15:24,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:24,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:15:24,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107154132] [2021-03-26 10:15:24,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:15:24,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:24,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:15:24,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:15:24,239 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 175 [2021-03-26 10:15:24,241 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 321 flow. Second operand has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:24,241 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:24,241 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 175 [2021-03-26 10:15:24,241 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:24,339 INFO L129 PetriNetUnfolder]: 62/180 cut-off events. [2021-03-26 10:15:24,339 INFO L130 PetriNetUnfolder]: For 767/781 co-relation queries the response was YES. [2021-03-26 10:15:24,340 INFO L84 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 180 events. 62/180 cut-off events. For 767/781 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 917 event pairs, 3 based on Foata normal form. 6/176 useless extension candidates. Maximal degree in co-relation 828. Up to 85 conditions per place. [2021-03-26 10:15:24,341 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 21 selfloop transitions, 13 changer transitions 0/50 dead transitions. [2021-03-26 10:15:24,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 50 transitions, 457 flow [2021-03-26 10:15:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:15:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:15:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions. [2021-03-26 10:15:24,344 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7394285714285714 [2021-03-26 10:15:24,344 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions. [2021-03-26 10:15:24,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions. [2021-03-26 10:15:24,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:24,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions. [2021-03-26 10:15:24,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have 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:15:24,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:24,347 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:24,348 INFO L185 Difference]: Start difference. First operand has 54 places, 43 transitions, 321 flow. Second operand 5 states and 647 transitions. [2021-03-26 10:15:24,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 50 transitions, 457 flow [2021-03-26 10:15:24,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 410 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-03-26 10:15:24,351 INFO L241 Difference]: Finished difference. Result has 55 places, 45 transitions, 343 flow [2021-03-26 10:15:24,352 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=343, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2021-03-26 10:15:24,352 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2021-03-26 10:15:24,352 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:24,352 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 45 transitions, 343 flow [2021-03-26 10:15:24,353 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 343 flow [2021-03-26 10:15:24,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 343 flow [2021-03-26 10:15:24,373 INFO L129 PetriNetUnfolder]: 58/174 cut-off events. [2021-03-26 10:15:24,373 INFO L130 PetriNetUnfolder]: For 642/644 co-relation queries the response was YES. [2021-03-26 10:15:24,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 174 events. 58/174 cut-off events. For 642/644 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 899 event pairs, 13 based on Foata normal form. 1/165 useless extension candidates. Maximal degree in co-relation 699. Up to 60 conditions per place. [2021-03-26 10:15:24,376 INFO L142 LiptonReduction]: Number of co-enabled transitions 436 [2021-03-26 10:15:24,384 INFO L154 LiptonReduction]: Checked pairs total: 488 [2021-03-26 10:15:24,384 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:24,384 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-03-26 10:15:24,385 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 343 flow [2021-03-26 10:15:24,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:24,385 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:24,385 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:24,385 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:15:24,385 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:15:24,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:24,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1205988673, now seen corresponding path program 5 times [2021-03-26 10:15:24,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:24,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721237673] [2021-03-26 10:15:24,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:24,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:15:24,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:15:24,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:15:24,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:15:24,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:15:24,472 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:15:24,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721237673] [2021-03-26 10:15:24,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:24,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:15:24,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460773975] [2021-03-26 10:15:24,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:15:24,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:24,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:15:24,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:15:24,474 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 175 [2021-03-26 10:15:24,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 343 flow. Second operand has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have 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:15:24,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:24,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 175 [2021-03-26 10:15:24,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:24,635 INFO L129 PetriNetUnfolder]: 57/187 cut-off events. [2021-03-26 10:15:24,635 INFO L130 PetriNetUnfolder]: For 871/893 co-relation queries the response was YES. [2021-03-26 10:15:24,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 187 events. 57/187 cut-off events. For 871/893 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1012 event pairs, 3 based on Foata normal form. 13/189 useless extension candidates. Maximal degree in co-relation 846. Up to 62 conditions per place. [2021-03-26 10:15:24,637 INFO L132 encePairwiseOnDemand]: 168/175 looper letters, 12 selfloop transitions, 26 changer transitions 0/54 dead transitions. [2021-03-26 10:15:24,637 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 495 flow [2021-03-26 10:15:24,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:15:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:15:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 923 transitions. [2021-03-26 10:15:24,640 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7534693877551021 [2021-03-26 10:15:24,640 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 923 transitions. [2021-03-26 10:15:24,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 923 transitions. [2021-03-26 10:15:24,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:24,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 923 transitions. [2021-03-26 10:15:24,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have 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:15:24,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:24,645 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:24,645 INFO L185 Difference]: Start difference. First operand has 55 places, 45 transitions, 343 flow. Second operand 7 states and 923 transitions. [2021-03-26 10:15:24,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 495 flow [2021-03-26 10:15:24,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 468 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-03-26 10:15:24,649 INFO L241 Difference]: Finished difference. Result has 60 places, 51 transitions, 462 flow [2021-03-26 10:15:24,649 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=462, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2021-03-26 10:15:24,650 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2021-03-26 10:15:24,650 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:24,650 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 51 transitions, 462 flow [2021-03-26 10:15:24,650 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 51 transitions, 462 flow [2021-03-26 10:15:24,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 51 transitions, 462 flow [2021-03-26 10:15:24,673 INFO L129 PetriNetUnfolder]: 55/187 cut-off events. [2021-03-26 10:15:24,673 INFO L130 PetriNetUnfolder]: For 802/805 co-relation queries the response was YES. [2021-03-26 10:15:24,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 187 events. 55/187 cut-off events. For 802/805 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1027 event pairs, 5 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 831. Up to 62 conditions per place. [2021-03-26 10:15:24,676 INFO L142 LiptonReduction]: Number of co-enabled transitions 480 [2021-03-26 10:15:24,684 INFO L154 LiptonReduction]: Checked pairs total: 726 [2021-03-26 10:15:24,684 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:24,684 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34 [2021-03-26 10:15:24,686 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 462 flow [2021-03-26 10:15:24,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have 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:15:24,687 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:24,687 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:24,687 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:15:24,687 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:15:24,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:24,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1204777379, now seen corresponding path program 1 times [2021-03-26 10:15:24,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:24,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413174573] [2021-03-26 10:15:24,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:24,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:24,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:24,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:24,729 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:15:24,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413174573] [2021-03-26 10:15:24,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:24,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:15:24,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728985214] [2021-03-26 10:15:24,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:15:24,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:24,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:15:24,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:15:24,731 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 175 [2021-03-26 10:15:24,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 462 flow. Second operand has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have 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:15:24,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:24,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 175 [2021-03-26 10:15:24,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:24,805 INFO L129 PetriNetUnfolder]: 186/426 cut-off events. [2021-03-26 10:15:24,805 INFO L130 PetriNetUnfolder]: For 2071/2307 co-relation queries the response was YES. [2021-03-26 10:15:24,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 426 events. 186/426 cut-off events. For 2071/2307 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 2680 event pairs, 65 based on Foata normal form. 94/435 useless extension candidates. Maximal degree in co-relation 1495. Up to 255 conditions per place. [2021-03-26 10:15:24,809 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 15 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2021-03-26 10:15:24,809 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 530 flow [2021-03-26 10:15:24,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:15:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:15:24,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 725 transitions. [2021-03-26 10:15:24,811 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2021-03-26 10:15:24,811 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 725 transitions. [2021-03-26 10:15:24,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 725 transitions. [2021-03-26 10:15:24,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:24,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 725 transitions. [2021-03-26 10:15:24,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have 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:15:24,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:24,815 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:24,815 INFO L185 Difference]: Start difference. First operand has 60 places, 51 transitions, 462 flow. Second operand 5 states and 725 transitions. [2021-03-26 10:15:24,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 530 flow [2021-03-26 10:15:24,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 62 transitions, 505 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-26 10:15:24,820 INFO L241 Difference]: Finished difference. Result has 64 places, 58 transitions, 517 flow [2021-03-26 10:15:24,821 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=517, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2021-03-26 10:15:24,821 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2021-03-26 10:15:24,821 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:24,821 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 58 transitions, 517 flow [2021-03-26 10:15:24,821 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 58 transitions, 517 flow [2021-03-26 10:15:24,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 58 transitions, 517 flow [2021-03-26 10:15:24,878 INFO L129 PetriNetUnfolder]: 143/356 cut-off events. [2021-03-26 10:15:24,878 INFO L130 PetriNetUnfolder]: For 1688/1840 co-relation queries the response was YES. [2021-03-26 10:15:24,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 356 events. 143/356 cut-off events. For 1688/1840 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2174 event pairs, 41 based on Foata normal form. 18/333 useless extension candidates. Maximal degree in co-relation 1512. Up to 187 conditions per place. [2021-03-26 10:15:24,883 INFO L142 LiptonReduction]: Number of co-enabled transitions 552 [2021-03-26 10:15:24,891 INFO L154 LiptonReduction]: Checked pairs total: 351 [2021-03-26 10:15:24,891 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:24,891 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 70 [2021-03-26 10:15:24,892 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 517 flow [2021-03-26 10:15:24,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have 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:15:24,892 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:24,892 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:24,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:15:24,892 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:15:24,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:24,893 INFO L82 PathProgramCache]: Analyzing trace with hash 583779411, now seen corresponding path program 1 times [2021-03-26 10:15:24,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:24,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092164682] [2021-03-26 10:15:24,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:24,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:24,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:24,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:24,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:24,942 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:15:24,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092164682] [2021-03-26 10:15:24,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:24,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:15:24,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335357748] [2021-03-26 10:15:24,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:15:24,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:24,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:15:24,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:15:24,944 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 175 [2021-03-26 10:15:24,945 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 517 flow. Second operand has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have 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:15:24,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:24,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 175 [2021-03-26 10:15:24,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:25,026 INFO L129 PetriNetUnfolder]: 116/306 cut-off events. [2021-03-26 10:15:25,026 INFO L130 PetriNetUnfolder]: For 2694/3932 co-relation queries the response was YES. [2021-03-26 10:15:25,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 306 events. 116/306 cut-off events. For 2694/3932 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 1825 event pairs, 7 based on Foata normal form. 192/456 useless extension candidates. Maximal degree in co-relation 1273. Up to 182 conditions per place. [2021-03-26 10:15:25,029 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 9 selfloop transitions, 15 changer transitions 5/59 dead transitions. [2021-03-26 10:15:25,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 59 transitions, 499 flow [2021-03-26 10:15:25,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:15:25,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:15:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1015 transitions. [2021-03-26 10:15:25,032 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2021-03-26 10:15:25,032 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1015 transitions. [2021-03-26 10:15:25,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1015 transitions. [2021-03-26 10:15:25,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:25,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1015 transitions. [2021-03-26 10:15:25,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.0) internal successors, (1015), 7 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have 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:15:25,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:25,037 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:25,037 INFO L185 Difference]: Start difference. First operand has 64 places, 58 transitions, 517 flow. Second operand 7 states and 1015 transitions. [2021-03-26 10:15:25,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 59 transitions, 499 flow [2021-03-26 10:15:25,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 480 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 10:15:25,044 INFO L241 Difference]: Finished difference. Result has 69 places, 52 transitions, 443 flow [2021-03-26 10:15:25,044 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=443, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2021-03-26 10:15:25,044 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2021-03-26 10:15:25,044 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:25,044 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 52 transitions, 443 flow [2021-03-26 10:15:25,045 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 52 transitions, 443 flow [2021-03-26 10:15:25,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 52 transitions, 443 flow [2021-03-26 10:15:25,068 INFO L129 PetriNetUnfolder]: 65/223 cut-off events. [2021-03-26 10:15:25,068 INFO L130 PetriNetUnfolder]: For 1563/1885 co-relation queries the response was YES. [2021-03-26 10:15:25,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 223 events. 65/223 cut-off events. For 1563/1885 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1336 event pairs, 7 based on Foata normal form. 12/217 useless extension candidates. Maximal degree in co-relation 1057. Up to 128 conditions per place. [2021-03-26 10:15:25,071 INFO L142 LiptonReduction]: Number of co-enabled transitions 578 [2021-03-26 10:15:25,077 INFO L154 LiptonReduction]: Checked pairs total: 250 [2021-03-26 10:15:25,077 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:25,077 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-26 10:15:25,078 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 443 flow [2021-03-26 10:15:25,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have 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:15:25,078 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:25,078 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:15:25,078 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:15:25,078 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:15:25,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:25,079 INFO L82 PathProgramCache]: Analyzing trace with hash -121288443, now seen corresponding path program 1 times [2021-03-26 10:15:25,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:25,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193724471] [2021-03-26 10:15:25,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:25,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:25,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:25,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:25,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:25,120 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:15:25,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193724471] [2021-03-26 10:15:25,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:25,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:15:25,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200293181] [2021-03-26 10:15:25,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:15:25,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:25,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:15:25,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:15:25,122 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 175 [2021-03-26 10:15:25,122 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 443 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:15:25,122 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:25,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 175 [2021-03-26 10:15:25,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:25,169 INFO L129 PetriNetUnfolder]: 103/310 cut-off events. [2021-03-26 10:15:25,169 INFO L130 PetriNetUnfolder]: For 2341/2751 co-relation queries the response was YES. [2021-03-26 10:15:25,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 310 events. 103/310 cut-off events. For 2341/2751 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2010 event pairs, 12 based on Foata normal form. 22/297 useless extension candidates. Maximal degree in co-relation 1508. Up to 200 conditions per place. [2021-03-26 10:15:25,172 INFO L132 encePairwiseOnDemand]: 172/175 looper letters, 3 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2021-03-26 10:15:25,172 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 52 transitions, 455 flow [2021-03-26 10:15:25,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2021-03-26 10:15:25,174 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.88 [2021-03-26 10:15:25,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2021-03-26 10:15:25,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2021-03-26 10:15:25,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:25,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2021-03-26 10:15:25,176 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:15:25,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:25,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:25,177 INFO L185 Difference]: Start difference. First operand has 69 places, 52 transitions, 443 flow. Second operand 3 states and 462 transitions. [2021-03-26 10:15:25,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 52 transitions, 455 flow [2021-03-26 10:15:25,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 52 transitions, 408 flow, removed 15 selfloop flow, removed 3 redundant places. [2021-03-26 10:15:25,185 INFO L241 Difference]: Finished difference. Result has 69 places, 52 transitions, 407 flow [2021-03-26 10:15:25,185 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2021-03-26 10:15:25,186 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2021-03-26 10:15:25,186 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:25,186 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 52 transitions, 407 flow [2021-03-26 10:15:25,186 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 52 transitions, 407 flow [2021-03-26 10:15:25,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 52 transitions, 407 flow [2021-03-26 10:15:25,215 INFO L129 PetriNetUnfolder]: 103/310 cut-off events. [2021-03-26 10:15:25,216 INFO L130 PetriNetUnfolder]: For 1705/1786 co-relation queries the response was YES. [2021-03-26 10:15:25,217 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 310 events. 103/310 cut-off events. For 1705/1786 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2076 event pairs, 12 based on Foata normal form. 14/289 useless extension candidates. Maximal degree in co-relation 1259. Up to 99 conditions per place. [2021-03-26 10:15:25,220 INFO L142 LiptonReduction]: Number of co-enabled transitions 578 [2021-03-26 10:15:25,225 INFO L154 LiptonReduction]: Checked pairs total: 228 [2021-03-26 10:15:25,225 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:25,225 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-03-26 10:15:25,226 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 407 flow [2021-03-26 10:15:25,227 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:15:25,227 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:25,227 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:15:25,227 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:15:25,227 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:15:25,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:25,227 INFO L82 PathProgramCache]: Analyzing trace with hash -938455343, now seen corresponding path program 1 times [2021-03-26 10:15:25,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:25,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177203779] [2021-03-26 10:15:25,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:25,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:25,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:25,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:25,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:25,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:25,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:25,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:25,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:25,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:25,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:25,288 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:15:25,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177203779] [2021-03-26 10:15:25,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:25,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:15:25,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108979229] [2021-03-26 10:15:25,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:15:25,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:25,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:15:25,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:15:25,290 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 175 [2021-03-26 10:15:25,291 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 407 flow. Second operand has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have 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:15:25,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:25,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 175 [2021-03-26 10:15:25,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:25,403 INFO L129 PetriNetUnfolder]: 141/354 cut-off events. [2021-03-26 10:15:25,403 INFO L130 PetriNetUnfolder]: For 2657/4042 co-relation queries the response was YES. [2021-03-26 10:15:25,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1450 conditions, 354 events. 141/354 cut-off events. For 2657/4042 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 2210 event pairs, 0 based on Foata normal form. 224/517 useless extension candidates. Maximal degree in co-relation 1419. Up to 110 conditions per place. [2021-03-26 10:15:25,406 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 5 selfloop transitions, 19 changer transitions 6/57 dead transitions. [2021-03-26 10:15:25,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 57 transitions, 475 flow [2021-03-26 10:15:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 10:15:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 10:15:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1299 transitions. [2021-03-26 10:15:25,410 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8247619047619048 [2021-03-26 10:15:25,410 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1299 transitions. [2021-03-26 10:15:25,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1299 transitions. [2021-03-26 10:15:25,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:25,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1299 transitions. [2021-03-26 10:15:25,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 144.33333333333334) internal successors, (1299), 9 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have 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:15:25,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 175.0) internal successors, (1750), 10 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have 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:15:25,416 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 175.0) internal successors, (1750), 10 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have 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:15:25,416 INFO L185 Difference]: Start difference. First operand has 69 places, 52 transitions, 407 flow. Second operand 9 states and 1299 transitions. [2021-03-26 10:15:25,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 57 transitions, 475 flow [2021-03-26 10:15:25,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 57 transitions, 443 flow, removed 11 selfloop flow, removed 3 redundant places. [2021-03-26 10:15:25,420 INFO L241 Difference]: Finished difference. Result has 77 places, 49 transitions, 402 flow [2021-03-26 10:15:25,421 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=402, PETRI_PLACES=77, PETRI_TRANSITIONS=49} [2021-03-26 10:15:25,421 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2021-03-26 10:15:25,421 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:25,421 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 49 transitions, 402 flow [2021-03-26 10:15:25,422 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 49 transitions, 402 flow [2021-03-26 10:15:25,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 49 transitions, 402 flow [2021-03-26 10:15:25,435 INFO L129 PetriNetUnfolder]: 35/129 cut-off events. [2021-03-26 10:15:25,435 INFO L130 PetriNetUnfolder]: For 656/726 co-relation queries the response was YES. [2021-03-26 10:15:25,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 129 events. 35/129 cut-off events. For 656/726 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 666 event pairs, 0 based on Foata normal form. 5/123 useless extension candidates. Maximal degree in co-relation 537. Up to 45 conditions per place. [2021-03-26 10:15:25,437 INFO L142 LiptonReduction]: Number of co-enabled transitions 426 [2021-03-26 10:15:25,832 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 10:15:25,979 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 10:15:26,585 WARN L205 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 180 [2021-03-26 10:15:26,827 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2021-03-26 10:15:28,100 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 334 DAG size of output: 258 [2021-03-26 10:15:28,601 WARN L205 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 240 [2021-03-26 10:15:28,880 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:15:29,127 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:15:29,655 WARN L205 SmtUtils]: Spent 523.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:15:30,199 WARN L205 SmtUtils]: Spent 543.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:15:30,212 INFO L154 LiptonReduction]: Checked pairs total: 459 [2021-03-26 10:15:30,212 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-26 10:15:30,212 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4791 [2021-03-26 10:15:30,213 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 42 transitions, 374 flow [2021-03-26 10:15:30,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have 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:15:30,214 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:30,214 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:30,214 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 10:15:30,214 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:15:30,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:30,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1270824270, now seen corresponding path program 1 times [2021-03-26 10:15:30,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:30,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767419647] [2021-03-26 10:15:30,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:30,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:30,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:30,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:30,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:30,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:30,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:30,259 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:15:30,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767419647] [2021-03-26 10:15:30,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:30,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:15:30,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312842147] [2021-03-26 10:15:30,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:15:30,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:30,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:15:30,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:15:30,261 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 182 [2021-03-26 10:15:30,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 42 transitions, 374 flow. Second operand has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have 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:15:30,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:30,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 182 [2021-03-26 10:15:30,262 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:30,293 INFO L129 PetriNetUnfolder]: 29/97 cut-off events. [2021-03-26 10:15:30,293 INFO L130 PetriNetUnfolder]: For 575/598 co-relation queries the response was YES. [2021-03-26 10:15:30,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 97 events. 29/97 cut-off events. For 575/598 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 385 event pairs, 0 based on Foata normal form. 6/99 useless extension candidates. Maximal degree in co-relation 425. Up to 45 conditions per place. [2021-03-26 10:15:30,294 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 3 selfloop transitions, 1 changer transitions 12/37 dead transitions. [2021-03-26 10:15:30,294 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 37 transitions, 329 flow [2021-03-26 10:15:30,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:15:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:15:30,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 602 transitions. [2021-03-26 10:15:30,296 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2021-03-26 10:15:30,296 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 602 transitions. [2021-03-26 10:15:30,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 602 transitions. [2021-03-26 10:15:30,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:30,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 602 transitions. [2021-03-26 10:15:30,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have 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:15:30,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 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:15:30,299 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 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:15:30,299 INFO L185 Difference]: Start difference. First operand has 72 places, 42 transitions, 374 flow. Second operand 4 states and 602 transitions. [2021-03-26 10:15:30,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 37 transitions, 329 flow [2021-03-26 10:15:30,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 37 transitions, 273 flow, removed 17 selfloop flow, removed 12 redundant places. [2021-03-26 10:15:30,302 INFO L241 Difference]: Finished difference. Result has 58 places, 25 transitions, 164 flow [2021-03-26 10:15:30,302 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=58, PETRI_TRANSITIONS=25} [2021-03-26 10:15:30,302 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2021-03-26 10:15:30,303 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:30,303 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 25 transitions, 164 flow [2021-03-26 10:15:30,303 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 25 transitions, 164 flow [2021-03-26 10:15:30,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 25 transitions, 164 flow [2021-03-26 10:15:30,307 INFO L129 PetriNetUnfolder]: 8/38 cut-off events. [2021-03-26 10:15:30,307 INFO L130 PetriNetUnfolder]: For 152/156 co-relation queries the response was YES. [2021-03-26 10:15:30,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 38 events. 8/38 cut-off events. For 152/156 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 72 event pairs, 0 based on Foata normal form. 3/40 useless extension candidates. Maximal degree in co-relation 123. Up to 12 conditions per place. [2021-03-26 10:15:30,308 INFO L142 LiptonReduction]: Number of co-enabled transitions 76 [2021-03-26 10:15:30,517 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-26 10:15:30,929 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2021-03-26 10:15:31,061 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 10:15:31,255 INFO L154 LiptonReduction]: Checked pairs total: 16 [2021-03-26 10:15:31,255 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:15:31,255 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 952 [2021-03-26 10:15:31,256 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 24 transitions, 173 flow [2021-03-26 10:15:31,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have 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:15:31,256 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:31,256 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:15:31,256 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 10:15:31,257 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:15:31,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:31,257 INFO L82 PathProgramCache]: Analyzing trace with hash -171479674, now seen corresponding path program 1 times [2021-03-26 10:15:31,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:31,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693334244] [2021-03-26 10:15:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:15:31,282 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:15:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:15:31,306 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:15:31,330 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:15:31,331 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:15:31,331 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 10:15:31,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:15:31 BasicIcfg [2021-03-26 10:15:31,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:15:31,410 INFO L168 Benchmark]: Toolchain (without parser) took 25992.54 ms. Allocated memory was 255.9 MB in the beginning and 826.3 MB in the end (delta: 570.4 MB). Free memory was 235.1 MB in the beginning and 760.8 MB in the end (delta: -525.6 MB). Peak memory consumption was 43.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:31,411 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:15:31,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 560.65 ms. Allocated memory was 255.9 MB in the beginning and 369.1 MB in the end (delta: 113.2 MB). Free memory was 235.1 MB in the beginning and 329.0 MB in the end (delta: -93.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:31,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.65 ms. Allocated memory is still 369.1 MB. Free memory was 329.0 MB in the beginning and 326.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:31,411 INFO L168 Benchmark]: Boogie Preprocessor took 35.19 ms. Allocated memory is still 369.1 MB. Free memory was 326.1 MB in the beginning and 324.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:31,411 INFO L168 Benchmark]: RCFGBuilder took 1660.10 ms. Allocated memory is still 369.1 MB. Free memory was 323.6 MB in the beginning and 339.4 MB in the end (delta: -15.8 MB). Peak memory consumption was 65.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:31,412 INFO L168 Benchmark]: TraceAbstraction took 23667.04 ms. Allocated memory was 369.1 MB in the beginning and 826.3 MB in the end (delta: 457.2 MB). Free memory was 339.4 MB in the beginning and 760.8 MB in the end (delta: -421.4 MB). Peak memory consumption was 35.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:31,413 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.53 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 560.65 ms. Allocated memory was 255.9 MB in the beginning and 369.1 MB in the end (delta: 113.2 MB). Free memory was 235.1 MB in the beginning and 329.0 MB in the end (delta: -93.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 58.65 ms. Allocated memory is still 369.1 MB. Free memory was 329.0 MB in the beginning and 326.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 35.19 ms. Allocated memory is still 369.1 MB. Free memory was 326.1 MB in the beginning and 324.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1660.10 ms. Allocated memory is still 369.1 MB. Free memory was 323.6 MB in the beginning and 339.4 MB in the end (delta: -15.8 MB). Peak memory consumption was 65.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 23667.04 ms. Allocated memory was 369.1 MB in the beginning and 826.3 MB in the end (delta: 457.2 MB). Free memory was 339.4 MB in the beginning and 760.8 MB in the end (delta: -421.4 MB). Peak memory consumption was 35.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8421.5ms, 101 PlacesBefore, 45 PlacesAfterwards, 93 TransitionsBefore, 36 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 6 FixpointIterations, 26 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, 2725 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1341, positive: 1260, positive conditional: 1260, positive unconditional: 0, negative: 81, negative conditional: 81, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1341, positive: 1260, positive conditional: 0, positive unconditional: 1260, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1341, positive: 1260, positive conditional: 0, positive unconditional: 1260, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1078, positive: 1046, positive conditional: 0, positive unconditional: 1046, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1078, positive: 1042, positive conditional: 0, positive unconditional: 1042, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 565, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 555, negative conditional: 0, negative unconditional: 555, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1341, positive: 214, positive conditional: 0, positive unconditional: 214, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 1078, unknown conditional: 0, unknown unconditional: 1078] , Statistics on independence cache: Total cache size (in pairs): 1078, Positive cache size: 1046, Positive conditional cache size: 0, Positive unconditional cache size: 1046, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3412.0ms, 42 PlacesBefore, 31 PlacesAfterwards, 31 TransitionsBefore, 22 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 1024 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 237, positive: 158, positive conditional: 158, positive unconditional: 0, negative: 79, negative conditional: 79, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 237, positive: 158, positive conditional: 18, positive unconditional: 140, negative: 79, negative conditional: 4, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 237, positive: 158, positive conditional: 18, positive unconditional: 140, negative: 79, negative conditional: 4, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 57, positive: 41, positive conditional: 2, positive unconditional: 39, negative: 16, negative conditional: 2, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 57, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 16, negative conditional: 2, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 390, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 387, negative conditional: 89, negative unconditional: 297, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 237, positive: 117, positive conditional: 16, positive unconditional: 101, negative: 63, negative conditional: 2, negative unconditional: 61, unknown: 57, unknown conditional: 4, unknown unconditional: 53] , Statistics on independence cache: Total cache size (in pairs): 1135, Positive cache size: 1087, Positive conditional cache size: 2, Positive unconditional cache size: 1085, Negative cache size: 48, Negative conditional cache size: 2, Negative unconditional cache size: 46, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 922.8ms, 32 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 440 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 97, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 97, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 97, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 1150, Positive cache size: 1100, Positive conditional cache size: 2, Positive unconditional cache size: 1098, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.0ms, 35 PlacesBefore, 35 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 176 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, positive: 40, positive conditional: 7, positive unconditional: 33, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, positive: 40, positive conditional: 7, positive unconditional: 33, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, positive: 37, positive conditional: 7, positive unconditional: 30, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1153, Positive cache size: 1103, Positive conditional cache size: 2, Positive unconditional cache size: 1101, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.0ms, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 202 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 12, negative conditional: 0, negative unconditional: 12, 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: 41, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1153, Positive cache size: 1103, Positive conditional cache size: 2, Positive unconditional cache size: 1101, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.8ms, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 191 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, positive: 43, positive conditional: 43, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53, positive: 43, positive conditional: 7, positive unconditional: 36, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53, positive: 43, positive conditional: 7, positive unconditional: 36, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 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] ], Cache Queries: [ total: 53, positive: 37, positive conditional: 7, positive unconditional: 30, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1159, Positive cache size: 1109, Positive conditional cache size: 2, Positive unconditional cache size: 1107, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.3ms, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 255 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, positive: 60, positive conditional: 14, positive unconditional: 46, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, positive: 60, positive conditional: 14, positive unconditional: 46, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 73, positive: 60, positive conditional: 14, positive unconditional: 46, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1159, Positive cache size: 1109, Positive conditional cache size: 2, Positive unconditional cache size: 1107, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.2ms, 48 PlacesBefore, 48 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 311 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, positive: 81, positive conditional: 81, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 97, positive: 81, positive conditional: 32, positive unconditional: 49, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 97, positive: 81, positive conditional: 32, positive unconditional: 49, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 97, positive: 79, positive conditional: 30, positive unconditional: 49, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1161, Positive cache size: 1111, Positive conditional cache size: 4, Positive unconditional cache size: 1107, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Eliminated conditions: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 873.7ms, 50 PlacesBefore, 50 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 786 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 246, positive: 208, positive conditional: 208, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 246, positive: 208, positive conditional: 83, positive unconditional: 125, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 246, positive: 208, positive conditional: 83, positive unconditional: 125, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 2, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 246, positive: 201, positive conditional: 81, positive unconditional: 120, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1168, Positive cache size: 1118, Positive conditional cache size: 6, Positive unconditional cache size: 1112, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Eliminated conditions: 63 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.8ms, 54 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 426 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 120, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 120, positive: 99, positive conditional: 32, positive unconditional: 67, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 120, positive: 99, positive conditional: 32, positive unconditional: 67, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 120, positive: 96, positive conditional: 29, positive unconditional: 67, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1171, Positive cache size: 1121, Positive conditional cache size: 9, Positive unconditional cache size: 1112, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Eliminated conditions: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.4ms, 55 PlacesBefore, 55 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 488 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, positive: 91, positive conditional: 91, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, positive: 91, positive conditional: 28, positive unconditional: 63, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 91, positive conditional: 28, positive unconditional: 63, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 116, positive: 91, positive conditional: 28, positive unconditional: 63, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1171, Positive cache size: 1121, Positive conditional cache size: 9, Positive unconditional cache size: 1112, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Eliminated conditions: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.6ms, 60 PlacesBefore, 60 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 726 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125, positive: 93, positive conditional: 93, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125, positive: 93, positive conditional: 54, positive unconditional: 39, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125, positive: 93, positive conditional: 54, positive unconditional: 39, negative: 32, negative conditional: 0, negative unconditional: 32, 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: 125, positive: 92, positive conditional: 53, positive unconditional: 39, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1172, Positive cache size: 1122, Positive conditional cache size: 10, Positive unconditional cache size: 1112, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 69.7ms, 64 PlacesBefore, 64 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 351 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1173, Positive cache size: 1123, Positive conditional cache size: 11, Positive unconditional cache size: 1112, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.4ms, 69 PlacesBefore, 69 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 250 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, positive: 46, positive conditional: 46, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, positive: 46, positive conditional: 44, positive unconditional: 2, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 46, positive conditional: 44, positive unconditional: 2, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, positive: 40, positive conditional: 38, positive unconditional: 2, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1179, Positive cache size: 1129, Positive conditional cache size: 17, Positive unconditional cache size: 1112, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.2ms, 69 PlacesBefore, 69 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 228 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, positive: 45, positive conditional: 45, 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: 54, positive: 45, positive conditional: 36, positive unconditional: 9, 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: 54, positive: 45, positive conditional: 36, positive unconditional: 9, 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: 7, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, positive: 38, positive conditional: 29, positive unconditional: 9, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1186, Positive cache size: 1136, Positive conditional cache size: 24, Positive unconditional cache size: 1112, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4790.7ms, 77 PlacesBefore, 72 PlacesAfterwards, 49 TransitionsBefore, 42 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 459 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, positive: 296, positive conditional: 296, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 315, positive: 296, positive conditional: 151, positive unconditional: 145, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 315, positive: 296, positive conditional: 151, positive unconditional: 145, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, positive: 30, positive conditional: 5, positive unconditional: 25, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 315, positive: 266, positive conditional: 146, positive unconditional: 120, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 32, unknown conditional: 5, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 1218, Positive cache size: 1166, Positive conditional cache size: 29, Positive unconditional cache size: 1137, Negative cache size: 52, Negative conditional cache size: 2, Negative unconditional cache size: 50, Eliminated conditions: 152 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 952.3ms, 58 PlacesBefore, 51 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 16 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 16, 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: 16, positive: 16, positive conditional: 13, positive unconditional: 3, 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: 16, positive: 16, positive conditional: 13, positive unconditional: 3, 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: 6, positive: 6, positive conditional: 4, 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: 6, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 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] ], Cache Queries: [ total: 16, positive: 10, positive conditional: 9, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1224, Positive cache size: 1172, Positive conditional cache size: 33, Positive unconditional cache size: 1139, Negative cache size: 52, Negative conditional cache size: 2, Negative unconditional cache size: 50, Eliminated conditions: 3 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1510; [L814] FCALL, FORK 0 pthread_create(&t1510, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1511; [L816] FCALL, FORK 0 pthread_create(&t1511, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1512; [L818] FCALL, FORK 0 pthread_create(&t1512, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L756] 2 x = 2 [L759] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 23476.0ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1580.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8517.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 58 SDtfs, 31 SDslu, 21 SDs, 0 SdLazy, 374 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 463.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 581.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=517occurred in iteration=12, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 51.1ms SsaConstructionTime, 439.8ms SatisfiabilityAnalysisTime, 1248.6ms InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 1451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...