/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/mix045_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:10:31,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:10:31,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:10:31,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:10:31,698 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:10:31,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:10:31,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:10:31,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:10:31,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:10:31,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:10:31,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:10:31,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:10:31,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:10:31,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:10:31,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:10:31,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:10:31,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:10:31,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:10:31,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:10:31,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:10:31,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:10:31,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:10:31,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:10:31,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:10:31,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:10:31,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:10:31,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:10:31,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:10:31,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:10:31,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:10:31,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:10:31,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:10:31,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:10:31,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:10:31,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:10:31,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:10:31,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:10:31,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:10:31,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:10:31,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:10:31,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:10:31,749 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:10:31,789 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:10:31,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:10:31,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:10:31,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:10:31,793 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:10:31,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:10:31,793 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:10:31,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:10:31,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:10:31,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:10:31,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:10:31,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:10:31,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:10:31,795 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:10:31,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:10:31,795 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:10:31,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:10:31,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:10:31,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:10:31,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:10:31,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:10:31,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:10:31,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:10:31,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:10:31,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:10:31,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:10:31,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:10:31,797 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:10:31,797 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:10:31,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:10:31,797 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:10:32,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:10:32,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:10:32,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:10:32,166 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:10:32,166 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:10:32,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2021-03-26 10:10:32,240 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f7dd716/38299987e648411f824a98e57841722d/FLAGb8674584e [2021-03-26 10:10:32,811 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:10:32,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2021-03-26 10:10:32,826 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f7dd716/38299987e648411f824a98e57841722d/FLAGb8674584e [2021-03-26 10:10:33,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f7dd716/38299987e648411f824a98e57841722d [2021-03-26 10:10:33,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:10:33,116 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:10:33,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:10:33,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:10:33,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:10:33,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:10:33" (1/1) ... [2021-03-26 10:10:33,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d9c1660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:33, skipping insertion in model container [2021-03-26 10:10:33,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:10:33" (1/1) ... [2021-03-26 10:10:33,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:10:33,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:10:33,287 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/mix045_tso.oepc.i[949,962] [2021-03-26 10:10:33,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:10:33,532 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:10:33,541 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/mix045_tso.oepc.i[949,962] [2021-03-26 10:10:33,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:10:33,632 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:10:33,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:33 WrapperNode [2021-03-26 10:10:33,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:10:33,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:10:33,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:10:33,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:10:33,640 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:10:33" (1/1) ... [2021-03-26 10:10:33,662 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:10:33" (1/1) ... [2021-03-26 10:10:33,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:10:33,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:10:33,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:10:33,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:10:33,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:33" (1/1) ... [2021-03-26 10:10:33,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:33" (1/1) ... [2021-03-26 10:10:33,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:33" (1/1) ... [2021-03-26 10:10:33,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:33" (1/1) ... [2021-03-26 10:10:33,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:33" (1/1) ... [2021-03-26 10:10:33,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:33" (1/1) ... [2021-03-26 10:10:33,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:33" (1/1) ... [2021-03-26 10:10:33,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:10:33,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:10:33,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:10:33,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:10:33,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:33" (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:10:33,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:10:33,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:10:33,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:10:33,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:10:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:10:33,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:10:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:10:33,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:10:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:10:33,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:10:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:10:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:10:33,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:10:33,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:10:33,813 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:10:35,501 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:10:35,501 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:10:35,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:10:35 BoogieIcfgContainer [2021-03-26 10:10:35,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:10:35,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:10:35,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:10:35,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:10:35,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:10:33" (1/3) ... [2021-03-26 10:10:35,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed539b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:10:35, skipping insertion in model container [2021-03-26 10:10:35,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:33" (2/3) ... [2021-03-26 10:10:35,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed539b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:10:35, skipping insertion in model container [2021-03-26 10:10:35,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:10:35" (3/3) ... [2021-03-26 10:10:35,508 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_tso.oepc.i [2021-03-26 10:10:35,513 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:10:35,517 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:10:35,518 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:10:35,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,547 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,548 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,548 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,548 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,549 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,549 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,549 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,549 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,555 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,555 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,555 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,555 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,556 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,556 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,556 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,556 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,561 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,561 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,561 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,562 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,565 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,565 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,568 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,568 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,569 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:35,572 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:10:35,589 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:10:35,614 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:10:35,614 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:10:35,614 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:10:35,614 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:10:35,614 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:10:35,614 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:10:35,614 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:10:35,614 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:10:35,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2021-03-26 10:10:35,656 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-26 10:10:35,657 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:35,660 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 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/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 10:10:35,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 215 flow [2021-03-26 10:10:35,665 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:35,666 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:35,677 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:35,680 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:35,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:35,699 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-26 10:10:35,699 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:35,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 10:10:35,702 INFO L142 LiptonReduction]: Number of co-enabled transitions 1738 [2021-03-26 10:10:36,550 WARN L205 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-26 10:10:36,901 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:10:38,340 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:10:38,937 WARN L205 SmtUtils]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:10:40,036 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:10:40,437 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:10:40,545 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:10:41,746 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:10:42,098 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:10:43,349 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 267 DAG size of output: 266 [2021-03-26 10:10:43,936 WARN L205 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 10:10:44,171 INFO L154 LiptonReduction]: Checked pairs total: 2726 [2021-03-26 10:10:44,171 INFO L156 LiptonReduction]: Total number of compositions: 67 [2021-03-26 10:10:44,175 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8510 [2021-03-26 10:10:44,189 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:10:44,189 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:44,190 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:44,190 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:44,191 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:10:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:44,196 INFO L82 PathProgramCache]: Analyzing trace with hash 429548733, now seen corresponding path program 1 times [2021-03-26 10:10:44,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:44,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775720627] [2021-03-26 10:10:44,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:44,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:44,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:44,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:44,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:44,441 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:10:44,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775720627] [2021-03-26 10:10:44,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:44,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:10:44,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178666746] [2021-03-26 10:10:44,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:10:44,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:44,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:10:44,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:10:44,459 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 167 [2021-03-26 10:10:44,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:44,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 167 [2021-03-26 10:10:44,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:44,524 INFO L129 PetriNetUnfolder]: 23/102 cut-off events. [2021-03-26 10:10:44,524 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:44,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 102 events. 23/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 3 based on Foata normal form. 5/99 useless extension candidates. Maximal degree in co-relation 139. Up to 37 conditions per place. [2021-03-26 10:10:44,526 INFO L132 encePairwiseOnDemand]: 163/167 looper letters, 7 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2021-03-26 10:10:44,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 113 flow [2021-03-26 10:10:44,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2021-03-26 10:10:44,538 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8902195608782435 [2021-03-26 10:10:44,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2021-03-26 10:10:44,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2021-03-26 10:10:44,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:44,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2021-03-26 10:10:44,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,554 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 446 transitions. [2021-03-26 10:10:44,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 113 flow [2021-03-26 10:10:44,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 110 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:10:44,563 INFO L241 Difference]: Finished difference. Result has 46 places, 34 transitions, 78 flow [2021-03-26 10:10:44,565 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2021-03-26 10:10:44,565 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2021-03-26 10:10:44,566 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:44,566 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 34 transitions, 78 flow [2021-03-26 10:10:44,567 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 78 flow [2021-03-26 10:10:44,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2021-03-26 10:10:44,576 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-26 10:10:44,576 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:44,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:10:44,577 INFO L142 LiptonReduction]: Number of co-enabled transitions 254 [2021-03-26 10:10:45,033 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:10:45,383 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:10:46,622 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 268 DAG size of output: 267 [2021-03-26 10:10:47,295 WARN L205 SmtUtils]: Spent 671.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:10:48,722 INFO L154 LiptonReduction]: Checked pairs total: 1054 [2021-03-26 10:10:48,722 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 10:10:48,723 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4157 [2021-03-26 10:10:48,724 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-03-26 10:10:48,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,724 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:48,724 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:48,725 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:10:48,725 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:10:48,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:48,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1980972199, now seen corresponding path program 1 times [2021-03-26 10:10:48,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:48,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567872777] [2021-03-26 10:10:48,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:48,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:48,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:48,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:48,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:48,894 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:10:48,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:10:48,897 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:10:48,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567872777] [2021-03-26 10:10:48,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:48,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:48,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106461713] [2021-03-26 10:10:48,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:10:48,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:48,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:10:48,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:10:48,901 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 178 [2021-03-26 10:10:48,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:48,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 178 [2021-03-26 10:10:48,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:48,929 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-26 10:10:48,930 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:48,930 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 1 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-03-26 10:10:48,931 INFO L132 encePairwiseOnDemand]: 174/178 looper letters, 3 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2021-03-26 10:10:48,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 72 flow [2021-03-26 10:10:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-03-26 10:10:48,940 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8782771535580525 [2021-03-26 10:10:48,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-03-26 10:10:48,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-03-26 10:10:48,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:48,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-03-26 10:10:48,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,948 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 469 transitions. [2021-03-26 10:10:48,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 72 flow [2021-03-26 10:10:48,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 25 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:48,949 INFO L241 Difference]: Finished difference. Result has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:48,949 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2021-03-26 10:10:48,949 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -16 predicate places. [2021-03-26 10:10:48,950 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:48,950 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:48,950 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:48,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:48,963 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 10:10:48,963 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:10:48,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 31 events. 3/31 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 10 conditions per place. [2021-03-26 10:10:48,964 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-26 10:10:49,613 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 10:10:49,758 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 10:10:50,073 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 10:10:50,239 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 10:10:50,242 INFO L154 LiptonReduction]: Checked pairs total: 633 [2021-03-26 10:10:50,242 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:10:50,243 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1293 [2021-03-26 10:10:50,244 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 67 flow [2021-03-26 10:10:50,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:50,244 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:50,244 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:50,244 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:10:50,245 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:10:50,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:50,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1508873391, now seen corresponding path program 1 times [2021-03-26 10:10:50,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:50,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816642858] [2021-03-26 10:10:50,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:50,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:50,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:50,339 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:10:50,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816642858] [2021-03-26 10:10:50,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:50,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:10:50,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486816614] [2021-03-26 10:10:50,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:10:50,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:50,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:10:50,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:10:50,342 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 180 [2021-03-26 10:10:50,342 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:50,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:50,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 180 [2021-03-26 10:10:50,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:50,358 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-26 10:10:50,358 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 10:10:50,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 33 events. 3/33 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 1 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-26 10:10:50,358 INFO L132 encePairwiseOnDemand]: 177/180 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-26 10:10:50,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 73 flow [2021-03-26 10:10:50,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2021-03-26 10:10:50,361 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8851851851851852 [2021-03-26 10:10:50,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2021-03-26 10:10:50,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2021-03-26 10:10:50,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:50,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2021-03-26 10:10:50,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:50,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:50,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:50,365 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 67 flow. Second operand 3 states and 478 transitions. [2021-03-26 10:10:50,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 73 flow [2021-03-26 10:10:50,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 70 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:10:50,366 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 72 flow [2021-03-26 10:10:50,366 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-03-26 10:10:50,367 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -16 predicate places. [2021-03-26 10:10:50,367 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:50,367 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-26 10:10:50,367 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-26 10:10:50,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 72 flow [2021-03-26 10:10:50,372 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2021-03-26 10:10:50,372 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 10:10:50,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-03-26 10:10:50,373 INFO L142 LiptonReduction]: Number of co-enabled transitions 236 [2021-03-26 10:10:50,375 INFO L154 LiptonReduction]: Checked pairs total: 198 [2021-03-26 10:10:50,375 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:50,375 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-26 10:10:50,376 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 72 flow [2021-03-26 10:10:50,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:50,377 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:50,377 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:50,377 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:10:50,377 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:10:50,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:50,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1510579461, now seen corresponding path program 1 times [2021-03-26 10:10:50,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:50,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121996386] [2021-03-26 10:10:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:50,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:50,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:50,473 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.6 percent of original size [2021-03-26 10:10:50,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-26 10:10:50,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:50,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:10:50,521 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:10:50,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121996386] [2021-03-26 10:10:50,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:50,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:50,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343082403] [2021-03-26 10:10:50,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:50,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:50,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:50,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:50,525 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 180 [2021-03-26 10:10:50,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:50,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:50,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 180 [2021-03-26 10:10:50,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:50,608 INFO L129 PetriNetUnfolder]: 61/146 cut-off events. [2021-03-26 10:10:50,608 INFO L130 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2021-03-26 10:10:50,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 146 events. 61/146 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 634 event pairs, 28 based on Foata normal form. 3/134 useless extension candidates. Maximal degree in co-relation 308. Up to 93 conditions per place. [2021-03-26 10:10:50,611 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 8 selfloop transitions, 8 changer transitions 0/32 dead transitions. [2021-03-26 10:10:50,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 125 flow [2021-03-26 10:10:50,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2021-03-26 10:10:50,615 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.77 [2021-03-26 10:10:50,615 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2021-03-26 10:10:50,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2021-03-26 10:10:50,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:50,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2021-03-26 10:10:50,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:50,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:50,619 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:50,619 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 72 flow. Second operand 5 states and 693 transitions. [2021-03-26 10:10:50,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 125 flow [2021-03-26 10:10:50,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 119 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:50,621 INFO L241 Difference]: Finished difference. Result has 38 places, 30 transitions, 123 flow [2021-03-26 10:10:50,621 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2021-03-26 10:10:50,621 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2021-03-26 10:10:50,621 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:50,621 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 123 flow [2021-03-26 10:10:50,622 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 123 flow [2021-03-26 10:10:50,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 123 flow [2021-03-26 10:10:50,634 INFO L129 PetriNetUnfolder]: 15/70 cut-off events. [2021-03-26 10:10:50,634 INFO L130 PetriNetUnfolder]: For 88/91 co-relation queries the response was YES. [2021-03-26 10:10:50,634 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 70 events. 15/70 cut-off events. For 88/91 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 274 event pairs, 5 based on Foata normal form. 1/61 useless extension candidates. Maximal degree in co-relation 163. Up to 23 conditions per place. [2021-03-26 10:10:50,635 INFO L142 LiptonReduction]: Number of co-enabled transitions 326 [2021-03-26 10:10:50,821 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:10:51,239 WARN L205 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2021-03-26 10:10:51,399 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 10:10:51,437 INFO L154 LiptonReduction]: Checked pairs total: 250 [2021-03-26 10:10:51,437 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:10:51,438 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 817 [2021-03-26 10:10:51,438 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 125 flow [2021-03-26 10:10:51,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:51,439 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:51,439 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:51,439 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:10:51,439 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:10:51,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:51,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1499624061, now seen corresponding path program 2 times [2021-03-26 10:10:51,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:51,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135940391] [2021-03-26 10:10:51,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:51,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:51,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:51,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:51,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:51,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:51,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:51,559 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:10:51,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135940391] [2021-03-26 10:10:51,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:51,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:51,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504355415] [2021-03-26 10:10:51,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:51,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:51,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:51,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:51,561 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 181 [2021-03-26 10:10:51,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:51,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:51,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 181 [2021-03-26 10:10:51,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:51,629 INFO L129 PetriNetUnfolder]: 55/134 cut-off events. [2021-03-26 10:10:51,629 INFO L130 PetriNetUnfolder]: For 162/168 co-relation queries the response was YES. [2021-03-26 10:10:51,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 134 events. 55/134 cut-off events. For 162/168 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 558 event pairs, 13 based on Foata normal form. 4/125 useless extension candidates. Maximal degree in co-relation 397. Up to 90 conditions per place. [2021-03-26 10:10:51,632 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 9 selfloop transitions, 10 changer transitions 0/35 dead transitions. [2021-03-26 10:10:51,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 184 flow [2021-03-26 10:10:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:10:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:10:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2021-03-26 10:10:51,635 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7776243093922652 [2021-03-26 10:10:51,635 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2021-03-26 10:10:51,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2021-03-26 10:10:51,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:51,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2021-03-26 10:10:51,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:51,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:51,643 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:51,644 INFO L185 Difference]: Start difference. First operand has 38 places, 30 transitions, 125 flow. Second operand 4 states and 563 transitions. [2021-03-26 10:10:51,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 184 flow [2021-03-26 10:10:51,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 182 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-26 10:10:51,649 INFO L241 Difference]: Finished difference. Result has 43 places, 34 transitions, 180 flow [2021-03-26 10:10:51,649 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2021-03-26 10:10:51,649 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2021-03-26 10:10:51,649 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:51,649 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 180 flow [2021-03-26 10:10:51,650 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 180 flow [2021-03-26 10:10:51,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 180 flow [2021-03-26 10:10:51,662 INFO L129 PetriNetUnfolder]: 24/82 cut-off events. [2021-03-26 10:10:51,662 INFO L130 PetriNetUnfolder]: For 199/206 co-relation queries the response was YES. [2021-03-26 10:10:51,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 82 events. 24/82 cut-off events. For 199/206 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 309 event pairs, 7 based on Foata normal form. 1/70 useless extension candidates. Maximal degree in co-relation 249. Up to 29 conditions per place. [2021-03-26 10:10:51,663 INFO L142 LiptonReduction]: Number of co-enabled transitions 346 [2021-03-26 10:10:51,671 INFO L154 LiptonReduction]: Checked pairs total: 210 [2021-03-26 10:10:51,671 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:51,671 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-26 10:10:51,673 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 180 flow [2021-03-26 10:10:51,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:51,674 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:51,674 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:51,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:10:51,674 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:10:51,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1262809101, now seen corresponding path program 1 times [2021-03-26 10:10:51,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:51,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376782733] [2021-03-26 10:10:51,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:51,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:51,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:51,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:51,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:51,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:51,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:10:51,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:51,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:10:51,833 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:10:51,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376782733] [2021-03-26 10:10:51,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:51,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:10:51,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896552551] [2021-03-26 10:10:51,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:10:51,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:51,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:10:51,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:10:51,838 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 181 [2021-03-26 10:10:51,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 138.83333333333334) internal successors, (833), 6 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:51,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:51,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 181 [2021-03-26 10:10:51,840 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:51,961 INFO L129 PetriNetUnfolder]: 52/140 cut-off events. [2021-03-26 10:10:51,961 INFO L130 PetriNetUnfolder]: For 232/234 co-relation queries the response was YES. [2021-03-26 10:10:51,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 140 events. 52/140 cut-off events. For 232/234 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 653 event pairs, 5 based on Foata normal form. 6/135 useless extension candidates. Maximal degree in co-relation 467. Up to 58 conditions per place. [2021-03-26 10:10:51,963 INFO L132 encePairwiseOnDemand]: 174/181 looper letters, 11 selfloop transitions, 14 changer transitions 0/41 dead transitions. [2021-03-26 10:10:51,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 263 flow [2021-03-26 10:10:51,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2021-03-26 10:10:51,967 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7823204419889502 [2021-03-26 10:10:51,967 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2021-03-26 10:10:51,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2021-03-26 10:10:51,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:51,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2021-03-26 10:10:51,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:51,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:51,971 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:51,971 INFO L185 Difference]: Start difference. First operand has 43 places, 34 transitions, 180 flow. Second operand 5 states and 708 transitions. [2021-03-26 10:10:51,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 263 flow [2021-03-26 10:10:51,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 257 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:10:51,976 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 239 flow [2021-03-26 10:10:51,976 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-26 10:10:51,976 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2021-03-26 10:10:51,976 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:51,976 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 239 flow [2021-03-26 10:10:51,977 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 239 flow [2021-03-26 10:10:51,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 239 flow [2021-03-26 10:10:51,996 INFO L129 PetriNetUnfolder]: 29/90 cut-off events. [2021-03-26 10:10:51,996 INFO L130 PetriNetUnfolder]: For 200/205 co-relation queries the response was YES. [2021-03-26 10:10:51,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 90 events. 29/90 cut-off events. For 200/205 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 330 event pairs, 6 based on Foata normal form. 2/80 useless extension candidates. Maximal degree in co-relation 301. Up to 32 conditions per place. [2021-03-26 10:10:51,998 INFO L142 LiptonReduction]: Number of co-enabled transitions 390 [2021-03-26 10:10:52,001 INFO L154 LiptonReduction]: Checked pairs total: 198 [2021-03-26 10:10:52,002 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:52,002 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-26 10:10:52,003 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 239 flow [2021-03-26 10:10:52,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 138.83333333333334) internal successors, (833), 6 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:52,003 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:52,003 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:52,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:10:52,004 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:10:52,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:52,004 INFO L82 PathProgramCache]: Analyzing trace with hash -416675652, now seen corresponding path program 1 times [2021-03-26 10:10:52,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:52,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939287621] [2021-03-26 10:10:52,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:52,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:52,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:52,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:52,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:52,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:52,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:52,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:52,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:52,122 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:10:52,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939287621] [2021-03-26 10:10:52,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:52,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:52,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972987195] [2021-03-26 10:10:52,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:52,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:52,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:52,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:52,125 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 181 [2021-03-26 10:10:52,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 141.0) internal successors, (705), 5 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:52,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:52,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 181 [2021-03-26 10:10:52,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:52,199 INFO L129 PetriNetUnfolder]: 47/148 cut-off events. [2021-03-26 10:10:52,199 INFO L130 PetriNetUnfolder]: For 358/360 co-relation queries the response was YES. [2021-03-26 10:10:52,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 148 events. 47/148 cut-off events. For 358/360 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 713 event pairs, 10 based on Foata normal form. 8/145 useless extension candidates. Maximal degree in co-relation 546. Up to 58 conditions per place. [2021-03-26 10:10:52,201 INFO L132 encePairwiseOnDemand]: 176/181 looper letters, 14 selfloop transitions, 10 changer transitions 0/40 dead transitions. [2021-03-26 10:10:52,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 297 flow [2021-03-26 10:10:52,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:10:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:10:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 573 transitions. [2021-03-26 10:10:52,204 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7914364640883977 [2021-03-26 10:10:52,204 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 573 transitions. [2021-03-26 10:10:52,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 573 transitions. [2021-03-26 10:10:52,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:52,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 573 transitions. [2021-03-26 10:10:52,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:52,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:52,207 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:52,207 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 239 flow. Second operand 4 states and 573 transitions. [2021-03-26 10:10:52,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 297 flow [2021-03-26 10:10:52,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 289 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-26 10:10:52,211 INFO L241 Difference]: Finished difference. Result has 51 places, 38 transitions, 262 flow [2021-03-26 10:10:52,211 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2021-03-26 10:10:52,211 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2021-03-26 10:10:52,211 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:52,212 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 38 transitions, 262 flow [2021-03-26 10:10:52,212 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 38 transitions, 262 flow [2021-03-26 10:10:52,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 38 transitions, 262 flow [2021-03-26 10:10:52,223 INFO L129 PetriNetUnfolder]: 23/91 cut-off events. [2021-03-26 10:10:52,224 INFO L130 PetriNetUnfolder]: For 247/252 co-relation queries the response was YES. [2021-03-26 10:10:52,224 INFO L84 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 91 events. 23/91 cut-off events. For 247/252 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 5 based on Foata normal form. 3/84 useless extension candidates. Maximal degree in co-relation 303. Up to 27 conditions per place. [2021-03-26 10:10:52,225 INFO L142 LiptonReduction]: Number of co-enabled transitions 386 [2021-03-26 10:10:52,229 INFO L154 LiptonReduction]: Checked pairs total: 219 [2021-03-26 10:10:52,229 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:52,229 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-26 10:10:52,232 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 262 flow [2021-03-26 10:10:52,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 141.0) internal successors, (705), 5 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:52,232 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:52,257 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:52,258 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:10:52,258 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:10:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:52,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2074672454, now seen corresponding path program 1 times [2021-03-26 10:10:52,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:52,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586110689] [2021-03-26 10:10:52,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:52,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:52,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:52,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:52,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:52,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:52,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:52,338 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:10:52,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586110689] [2021-03-26 10:10:52,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:52,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:52,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41672544] [2021-03-26 10:10:52,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:10:52,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:52,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:10:52,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:10:52,341 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2021-03-26 10:10:52,341 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:52,342 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:52,342 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2021-03-26 10:10:52,342 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:52,421 INFO L129 PetriNetUnfolder]: 162/375 cut-off events. [2021-03-26 10:10:52,421 INFO L130 PetriNetUnfolder]: For 546/593 co-relation queries the response was YES. [2021-03-26 10:10:52,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1061 conditions, 375 events. 162/375 cut-off events. For 546/593 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 2297 event pairs, 56 based on Foata normal form. 44/346 useless extension candidates. Maximal degree in co-relation 1037. Up to 222 conditions per place. [2021-03-26 10:10:52,425 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 11 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2021-03-26 10:10:52,425 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 322 flow [2021-03-26 10:10:52,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 770 transitions. [2021-03-26 10:10:52,428 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.850828729281768 [2021-03-26 10:10:52,428 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 770 transitions. [2021-03-26 10:10:52,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 770 transitions. [2021-03-26 10:10:52,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:52,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 770 transitions. [2021-03-26 10:10:52,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:52,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:52,432 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:52,432 INFO L185 Difference]: Start difference. First operand has 51 places, 38 transitions, 262 flow. Second operand 5 states and 770 transitions. [2021-03-26 10:10:52,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 322 flow [2021-03-26 10:10:52,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 302 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:10:52,436 INFO L241 Difference]: Finished difference. Result has 55 places, 45 transitions, 306 flow [2021-03-26 10:10:52,436 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2021-03-26 10:10:52,436 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2021-03-26 10:10:52,437 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:52,437 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 45 transitions, 306 flow [2021-03-26 10:10:52,437 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 306 flow [2021-03-26 10:10:52,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 306 flow [2021-03-26 10:10:52,465 INFO L129 PetriNetUnfolder]: 118/272 cut-off events. [2021-03-26 10:10:52,465 INFO L130 PetriNetUnfolder]: For 586/628 co-relation queries the response was YES. [2021-03-26 10:10:52,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 272 events. 118/272 cut-off events. For 586/628 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1502 event pairs, 42 based on Foata normal form. 5/241 useless extension candidates. Maximal degree in co-relation 917. Up to 151 conditions per place. [2021-03-26 10:10:52,469 INFO L142 LiptonReduction]: Number of co-enabled transitions 474 [2021-03-26 10:10:52,475 INFO L154 LiptonReduction]: Checked pairs total: 107 [2021-03-26 10:10:52,475 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:52,476 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-03-26 10:10:52,476 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 306 flow [2021-03-26 10:10:52,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:52,477 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:52,477 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:10:52,477 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:10:52,477 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:10:52,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:52,477 INFO L82 PathProgramCache]: Analyzing trace with hash 63133914, now seen corresponding path program 1 times [2021-03-26 10:10:52,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:52,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038942625] [2021-03-26 10:10:52,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:52,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:52,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:52,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:52,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:52,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:52,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:52,535 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:10:52,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038942625] [2021-03-26 10:10:52,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:52,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:52,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409661387] [2021-03-26 10:10:52,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:10:52,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:52,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:10:52,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:10:52,537 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 181 [2021-03-26 10:10:52,537 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:52,537 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:52,537 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 181 [2021-03-26 10:10:52,537 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:52,611 INFO L129 PetriNetUnfolder]: 220/525 cut-off events. [2021-03-26 10:10:52,612 INFO L130 PetriNetUnfolder]: For 1496/1696 co-relation queries the response was YES. [2021-03-26 10:10:52,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1762 conditions, 525 events. 220/525 cut-off events. For 1496/1696 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 3582 event pairs, 73 based on Foata normal form. 34/496 useless extension candidates. Maximal degree in co-relation 1736. Up to 309 conditions per place. [2021-03-26 10:10:52,616 INFO L132 encePairwiseOnDemand]: 178/181 looper letters, 4 selfloop transitions, 2 changer transitions 5/47 dead transitions. [2021-03-26 10:10:52,616 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 332 flow [2021-03-26 10:10:52,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:10:52,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:10:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions. [2021-03-26 10:10:52,619 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.888121546961326 [2021-03-26 10:10:52,619 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 643 transitions. [2021-03-26 10:10:52,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions. [2021-03-26 10:10:52,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:52,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions. [2021-03-26 10:10:52,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:52,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:52,623 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:52,623 INFO L185 Difference]: Start difference. First operand has 55 places, 45 transitions, 306 flow. Second operand 4 states and 643 transitions. [2021-03-26 10:10:52,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 332 flow [2021-03-26 10:10:52,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:10:52,628 INFO L241 Difference]: Finished difference. Result has 59 places, 41 transitions, 267 flow [2021-03-26 10:10:52,628 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=267, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2021-03-26 10:10:52,629 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2021-03-26 10:10:52,629 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:52,629 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 41 transitions, 267 flow [2021-03-26 10:10:52,629 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 41 transitions, 267 flow [2021-03-26 10:10:52,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 41 transitions, 267 flow [2021-03-26 10:10:52,671 INFO L129 PetriNetUnfolder]: 189/431 cut-off events. [2021-03-26 10:10:52,671 INFO L130 PetriNetUnfolder]: For 897/981 co-relation queries the response was YES. [2021-03-26 10:10:52,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 431 events. 189/431 cut-off events. For 897/981 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 2812 event pairs, 70 based on Foata normal form. 11/383 useless extension candidates. Maximal degree in co-relation 1394. Up to 268 conditions per place. [2021-03-26 10:10:52,677 INFO L142 LiptonReduction]: Number of co-enabled transitions 484 [2021-03-26 10:10:52,887 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:10:53,222 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-26 10:10:53,332 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-26 10:10:53,349 INFO L154 LiptonReduction]: Checked pairs total: 31 [2021-03-26 10:10:53,349 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:10:53,349 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 720 [2021-03-26 10:10:53,349 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 269 flow [2021-03-26 10:10:53,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,350 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:53,350 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:53,350 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:10:53,350 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:10:53,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:53,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1393971103, now seen corresponding path program 1 times [2021-03-26 10:10:53,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:53,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955163160] [2021-03-26 10:10:53,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:53,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:53,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:53,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:53,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:53,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:53,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:53,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:53,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:53,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955163160] [2021-03-26 10:10:53,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:53,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:10:53,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772200228] [2021-03-26 10:10:53,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:53,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:53,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:53,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:53,401 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 182 [2021-03-26 10:10:53,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 269 flow. Second operand has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:53,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 182 [2021-03-26 10:10:53,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:53,485 INFO L129 PetriNetUnfolder]: 197/458 cut-off events. [2021-03-26 10:10:53,486 INFO L130 PetriNetUnfolder]: For 842/1312 co-relation queries the response was YES. [2021-03-26 10:10:53,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1696 conditions, 458 events. 197/458 cut-off events. For 842/1312 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 2833 event pairs, 11 based on Foata normal form. 102/504 useless extension candidates. Maximal degree in co-relation 1668. Up to 297 conditions per place. [2021-03-26 10:10:53,489 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 8 selfloop transitions, 11 changer transitions 3/49 dead transitions. [2021-03-26 10:10:53,489 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 49 transitions, 357 flow [2021-03-26 10:10:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:10:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:10:53,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 930 transitions. [2021-03-26 10:10:53,492 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8516483516483516 [2021-03-26 10:10:53,492 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 930 transitions. [2021-03-26 10:10:53,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 930 transitions. [2021-03-26 10:10:53,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:53,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 930 transitions. [2021-03-26 10:10:53,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,497 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,497 INFO L185 Difference]: Start difference. First operand has 59 places, 40 transitions, 269 flow. Second operand 6 states and 930 transitions. [2021-03-26 10:10:53,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 49 transitions, 357 flow [2021-03-26 10:10:53,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 328 flow, removed 5 selfloop flow, removed 6 redundant places. [2021-03-26 10:10:53,502 INFO L241 Difference]: Finished difference. Result has 59 places, 44 transitions, 310 flow [2021-03-26 10:10:53,503 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2021-03-26 10:10:53,503 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2021-03-26 10:10:53,503 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:53,503 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 44 transitions, 310 flow [2021-03-26 10:10:53,504 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 44 transitions, 310 flow [2021-03-26 10:10:53,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 44 transitions, 310 flow [2021-03-26 10:10:53,528 INFO L129 PetriNetUnfolder]: 82/253 cut-off events. [2021-03-26 10:10:53,528 INFO L130 PetriNetUnfolder]: For 704/780 co-relation queries the response was YES. [2021-03-26 10:10:53,529 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1061 conditions, 253 events. 82/253 cut-off events. For 704/780 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1548 event pairs, 10 based on Foata normal form. 2/238 useless extension candidates. Maximal degree in co-relation 1035. Up to 165 conditions per place. [2021-03-26 10:10:53,531 INFO L142 LiptonReduction]: Number of co-enabled transitions 424 [2021-03-26 10:10:53,543 INFO L154 LiptonReduction]: Checked pairs total: 21 [2021-03-26 10:10:53,543 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:10:53,543 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-03-26 10:10:53,545 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 302 flow [2021-03-26 10:10:53,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,545 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:53,545 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:10:53,545 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:10:53,545 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:10:53,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:53,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1160234617, now seen corresponding path program 1 times [2021-03-26 10:10:53,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:53,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909698923] [2021-03-26 10:10:53,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:53,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:53,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:53,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:53,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:53,592 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:10:53,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909698923] [2021-03-26 10:10:53,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:53,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:10:53,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103862180] [2021-03-26 10:10:53,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:10:53,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:53,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:10:53,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:10:53,594 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 182 [2021-03-26 10:10:53,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:53,595 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 182 [2021-03-26 10:10:53,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:53,670 INFO L129 PetriNetUnfolder]: 110/331 cut-off events. [2021-03-26 10:10:53,670 INFO L130 PetriNetUnfolder]: For 1034/1099 co-relation queries the response was YES. [2021-03-26 10:10:53,672 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 331 events. 110/331 cut-off events. For 1034/1099 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2080 event pairs, 18 based on Foata normal form. 8/321 useless extension candidates. Maximal degree in co-relation 1343. Up to 201 conditions per place. [2021-03-26 10:10:53,672 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 3 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2021-03-26 10:10:53,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 40 transitions, 284 flow [2021-03-26 10:10:53,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2021-03-26 10:10:53,675 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8901098901098901 [2021-03-26 10:10:53,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2021-03-26 10:10:53,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2021-03-26 10:10:53,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:53,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2021-03-26 10:10:53,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,679 INFO L185 Difference]: Start difference. First operand has 59 places, 43 transitions, 302 flow. Second operand 3 states and 486 transitions. [2021-03-26 10:10:53,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 40 transitions, 284 flow [2021-03-26 10:10:53,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 40 transitions, 264 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-26 10:10:53,684 INFO L241 Difference]: Finished difference. Result has 57 places, 40 transitions, 263 flow [2021-03-26 10:10:53,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2021-03-26 10:10:53,684 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2021-03-26 10:10:53,684 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:53,684 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 40 transitions, 263 flow [2021-03-26 10:10:53,684 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 40 transitions, 263 flow [2021-03-26 10:10:53,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 40 transitions, 263 flow [2021-03-26 10:10:53,714 INFO L129 PetriNetUnfolder]: 110/330 cut-off events. [2021-03-26 10:10:53,714 INFO L130 PetriNetUnfolder]: For 597/617 co-relation queries the response was YES. [2021-03-26 10:10:53,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 330 events. 110/330 cut-off events. For 597/617 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2072 event pairs, 18 based on Foata normal form. 2/313 useless extension candidates. Maximal degree in co-relation 1130. Up to 139 conditions per place. [2021-03-26 10:10:53,718 INFO L142 LiptonReduction]: Number of co-enabled transitions 346 [2021-03-26 10:10:53,721 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:10:53,721 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:53,722 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-26 10:10:53,724 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 263 flow [2021-03-26 10:10:53,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,725 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:53,725 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:10:53,725 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:10:53,725 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:10:53,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:53,726 INFO L82 PathProgramCache]: Analyzing trace with hash 2107403231, now seen corresponding path program 1 times [2021-03-26 10:10:53,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:53,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821653434] [2021-03-26 10:10:53,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:53,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:53,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:53,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:53,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:53,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:53,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:53,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:53,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:53,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:53,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:53,795 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:10:53,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821653434] [2021-03-26 10:10:53,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:53,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:10:53,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297811161] [2021-03-26 10:10:53,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:10:53,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:53,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:10:53,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:10:53,797 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 182 [2021-03-26 10:10:53,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:53,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 182 [2021-03-26 10:10:53,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:53,888 INFO L129 PetriNetUnfolder]: 186/431 cut-off events. [2021-03-26 10:10:53,888 INFO L130 PetriNetUnfolder]: For 660/1141 co-relation queries the response was YES. [2021-03-26 10:10:53,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1657 conditions, 431 events. 186/431 cut-off events. For 660/1141 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2604 event pairs, 0 based on Foata normal form. 99/464 useless extension candidates. Maximal degree in co-relation 1630. Up to 197 conditions per place. [2021-03-26 10:10:53,891 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 5 selfloop transitions, 11 changer transitions 13/47 dead transitions. [2021-03-26 10:10:53,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 47 transitions, 339 flow [2021-03-26 10:10:53,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:10:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:10:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1079 transitions. [2021-03-26 10:10:53,894 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8469387755102041 [2021-03-26 10:10:53,894 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1079 transitions. [2021-03-26 10:10:53,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1079 transitions. [2021-03-26 10:10:53,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:53,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1079 transitions. [2021-03-26 10:10:53,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 154.14285714285714) internal successors, (1079), 7 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,900 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,900 INFO L185 Difference]: Start difference. First operand has 57 places, 40 transitions, 263 flow. Second operand 7 states and 1079 transitions. [2021-03-26 10:10:53,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 47 transitions, 339 flow [2021-03-26 10:10:53,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 47 transitions, 310 flow, removed 11 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:53,903 INFO L241 Difference]: Finished difference. Result has 64 places, 32 transitions, 222 flow [2021-03-26 10:10:53,903 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=64, PETRI_TRANSITIONS=32} [2021-03-26 10:10:53,903 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2021-03-26 10:10:53,903 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:53,903 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 32 transitions, 222 flow [2021-03-26 10:10:53,904 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 32 transitions, 222 flow [2021-03-26 10:10:53,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 32 transitions, 222 flow [2021-03-26 10:10:53,911 INFO L129 PetriNetUnfolder]: 13/68 cut-off events. [2021-03-26 10:10:53,911 INFO L130 PetriNetUnfolder]: For 123/130 co-relation queries the response was YES. [2021-03-26 10:10:53,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 68 events. 13/68 cut-off events. For 123/130 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 215 event pairs, 0 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 261. Up to 27 conditions per place. [2021-03-26 10:10:53,912 INFO L142 LiptonReduction]: Number of co-enabled transitions 136 [2021-03-26 10:10:54,093 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:10:54,455 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-03-26 10:10:54,590 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:10:54,887 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:10:55,023 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:10:55,365 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-26 10:10:55,526 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-26 10:10:56,341 WARN L205 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 194 [2021-03-26 10:10:56,575 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:10:58,034 WARN L205 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 348 DAG size of output: 270 [2021-03-26 10:10:58,601 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:10:58,606 INFO L154 LiptonReduction]: Checked pairs total: 95 [2021-03-26 10:10:58,606 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-26 10:10:58,606 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4703 [2021-03-26 10:10:58,607 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 27 transitions, 210 flow [2021-03-26 10:10:58,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:58,607 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:58,608 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:10:58,608 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:10:58,608 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:10:58,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:58,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1901386554, now seen corresponding path program 1 times [2021-03-26 10:10:58,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:58,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534833040] [2021-03-26 10:10:58,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:10:58,637 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:10:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:10:58,664 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:10:58,699 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:10:58,699 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:10:58,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:10:58,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:10:58 BasicIcfg [2021-03-26 10:10:58,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:10:58,796 INFO L168 Benchmark]: Toolchain (without parser) took 25680.53 ms. Allocated memory was 255.9 MB in the beginning and 763.4 MB in the end (delta: 507.5 MB). Free memory was 234.5 MB in the beginning and 582.4 MB in the end (delta: -347.9 MB). Peak memory consumption was 159.5 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:58,797 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 255.9 MB. Free memory was 238.0 MB in the beginning and 238.0 MB in the end (delta: 26.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:10:58,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 516.00 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 234.5 MB in the beginning and 310.1 MB in the end (delta: -75.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:58,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.24 ms. Allocated memory is still 350.2 MB. Free memory was 310.1 MB in the beginning and 306.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:58,798 INFO L168 Benchmark]: Boogie Preprocessor took 33.08 ms. Allocated memory is still 350.2 MB. Free memory was 306.7 MB in the beginning and 304.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:58,798 INFO L168 Benchmark]: RCFGBuilder took 1778.78 ms. Allocated memory is still 350.2 MB. Free memory was 304.5 MB in the beginning and 316.3 MB in the end (delta: -11.8 MB). Peak memory consumption was 63.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:58,799 INFO L168 Benchmark]: TraceAbstraction took 23291.87 ms. Allocated memory was 350.2 MB in the beginning and 763.4 MB in the end (delta: 413.1 MB). Free memory was 316.3 MB in the beginning and 582.4 MB in the end (delta: -266.1 MB). Peak memory consumption was 148.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:58,804 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.19 ms. Allocated memory is still 255.9 MB. Free memory was 238.0 MB in the beginning and 238.0 MB in the end (delta: 26.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 516.00 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 234.5 MB in the beginning and 310.1 MB in the end (delta: -75.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 56.24 ms. Allocated memory is still 350.2 MB. Free memory was 310.1 MB in the beginning and 306.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 33.08 ms. Allocated memory is still 350.2 MB. Free memory was 306.7 MB in the beginning and 304.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1778.78 ms. Allocated memory is still 350.2 MB. Free memory was 304.5 MB in the beginning and 316.3 MB in the end (delta: -11.8 MB). Peak memory consumption was 63.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 23291.87 ms. Allocated memory was 350.2 MB in the beginning and 763.4 MB in the end (delta: 413.1 MB). Free memory was 316.3 MB in the beginning and 582.4 MB in the end (delta: -266.1 MB). Peak memory consumption was 148.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8491.8ms, 105 PlacesBefore, 49 PlacesAfterwards, 97 TransitionsBefore, 40 TransitionsAfterwards, 1738 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, 2726 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1601, positive: 1527, positive conditional: 1527, positive unconditional: 0, negative: 74, negative conditional: 74, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1601, positive: 1527, positive conditional: 0, positive unconditional: 1527, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1601, positive: 1527, positive conditional: 0, positive unconditional: 1527, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1212, positive: 1177, positive conditional: 0, positive unconditional: 1177, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1212, positive: 1171, positive conditional: 0, positive unconditional: 1171, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 570, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 555, negative conditional: 0, negative unconditional: 555, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1601, positive: 350, positive conditional: 0, positive unconditional: 350, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 1212, unknown conditional: 0, unknown unconditional: 1212] , Statistics on independence cache: Total cache size (in pairs): 1212, Positive cache size: 1177, Positive conditional cache size: 0, Positive unconditional cache size: 1177, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4155.7ms, 46 PlacesBefore, 32 PlacesAfterwards, 34 TransitionsBefore, 23 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1054 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 384, positive: 306, positive conditional: 306, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 384, positive: 306, positive conditional: 9, positive unconditional: 297, negative: 78, negative conditional: 2, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 384, positive: 306, positive conditional: 9, positive unconditional: 297, negative: 78, negative conditional: 2, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 68, positive: 46, positive conditional: 2, positive unconditional: 44, negative: 22, negative conditional: 2, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 68, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 22, negative conditional: 2, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 582, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 515, negative conditional: 94, negative unconditional: 421, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 384, positive: 260, positive conditional: 7, positive unconditional: 253, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 68, unknown conditional: 4, unknown unconditional: 64] , Statistics on independence cache: Total cache size (in pairs): 1280, Positive cache size: 1223, Positive conditional cache size: 2, Positive unconditional cache size: 1221, Negative cache size: 57, Negative conditional cache size: 2, Negative unconditional cache size: 55, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1292.4ms, 33 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 633 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, positive: 148, positive conditional: 148, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 196, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 196, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 196, positive: 141, positive conditional: 0, positive unconditional: 141, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 1293, Positive cache size: 1230, Positive conditional cache size: 2, Positive unconditional cache size: 1228, Negative cache size: 63, Negative conditional cache size: 2, Negative unconditional cache size: 61, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.1ms, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 198 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, positive: 56, positive conditional: 56, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 15, negative conditional: 0, negative unconditional: 15, 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: 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: 71, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1299, Positive cache size: 1236, Positive conditional cache size: 2, Positive unconditional cache size: 1234, Negative cache size: 63, Negative conditional cache size: 2, Negative unconditional cache size: 61, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 815.7ms, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 250 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, positive: 96, positive conditional: 96, 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: 112, positive: 96, positive conditional: 12, positive unconditional: 84, 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: 112, positive: 96, positive conditional: 12, positive unconditional: 84, 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: 7, positive: 6, positive conditional: 2, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 112, positive: 90, positive conditional: 10, positive unconditional: 80, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1306, Positive cache size: 1242, Positive conditional cache size: 4, Positive unconditional cache size: 1238, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.6ms, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 210 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, positive: 61, positive conditional: 4, positive unconditional: 57, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, positive: 61, positive conditional: 4, positive unconditional: 57, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, positive: 61, positive conditional: 4, positive unconditional: 57, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1306, Positive cache size: 1242, Positive conditional cache size: 4, Positive unconditional cache size: 1238, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.1ms, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 198 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, positive: 67, positive conditional: 67, 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: 79, positive: 67, positive conditional: 12, positive unconditional: 55, 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: 79, positive: 67, positive conditional: 12, positive unconditional: 55, 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: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, positive: 62, positive conditional: 7, positive unconditional: 55, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1311, Positive cache size: 1247, Positive conditional cache size: 9, Positive unconditional cache size: 1238, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.8ms, 51 PlacesBefore, 51 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 386 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 219 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, positive: 59, positive conditional: 59, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, positive: 59, positive conditional: 5, positive unconditional: 54, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, positive: 59, positive conditional: 5, positive unconditional: 54, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 73, positive: 58, positive conditional: 4, positive unconditional: 54, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1312, Positive cache size: 1248, Positive conditional cache size: 10, Positive unconditional cache size: 1238, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.6ms, 55 PlacesBefore, 55 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 107 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, positive: 17, positive conditional: 2, positive unconditional: 15, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 17, positive conditional: 2, positive unconditional: 15, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, positive: 15, positive conditional: 2, positive unconditional: 13, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1314, Positive cache size: 1250, Positive conditional cache size: 10, Positive unconditional cache size: 1240, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 719.8ms, 59 PlacesBefore, 59 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 31 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 31, 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: 31, positive: 31, positive conditional: 27, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 27, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 12, 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: 14, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 29, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, positive: 17, positive conditional: 15, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 14, unknown conditional: 12, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1328, Positive cache size: 1264, Positive conditional cache size: 22, Positive unconditional cache size: 1242, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.5ms, 59 PlacesBefore, 59 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 21 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, positive: 21, positive conditional: 16, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 16, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 6, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 21, positive: 14, positive conditional: 10, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1335, Positive cache size: 1271, Positive conditional cache size: 28, Positive unconditional cache size: 1243, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.2ms, 57 PlacesBefore, 57 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1335, Positive cache size: 1271, Positive conditional cache size: 28, Positive unconditional cache size: 1243, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4702.7ms, 64 PlacesBefore, 56 PlacesAfterwards, 32 TransitionsBefore, 27 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 95 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, positive: 47, positive conditional: 47, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87, positive: 47, positive conditional: 10, positive unconditional: 37, negative: 40, negative conditional: 32, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 47, positive conditional: 10, positive unconditional: 37, negative: 40, negative conditional: 32, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 2, positive unconditional: 3, negative: 5, negative conditional: 4, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 4, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 110, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 110, negative conditional: 71, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, positive: 42, positive conditional: 8, positive unconditional: 34, negative: 35, negative conditional: 28, negative unconditional: 7, unknown: 10, unknown conditional: 6, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1345, Positive cache size: 1276, Positive conditional cache size: 30, Positive unconditional cache size: 1246, Negative cache size: 69, Negative conditional cache size: 6, Negative unconditional cache size: 63, Eliminated conditions: 40 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1211; [L824] FCALL, FORK 0 pthread_create(&t1211, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L825] 0 pthread_t t1212; [L826] FCALL, FORK 0 pthread_create(&t1212, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L827] 0 pthread_t t1213; [L828] FCALL, FORK 0 pthread_create(&t1213, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=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] [L763] 2 y = 1 [L766] 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) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] 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) [L766] 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) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 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 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 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 [L801] 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) [L801] 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) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 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 [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 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 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] 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) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] 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) [L834] 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) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 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 [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 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 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 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) [L845] 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) [L846] 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)) [L846] 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) [L846] 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)) [L846] 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)) [L847] 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)) [L847] 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) [L847] 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)) [L847] 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)) [L848] 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)) [L848] 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) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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) [L849] 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)) [L849] 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)) [L850] 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)) [L850] 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) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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) [L851] 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)) [L851] 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)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, 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, 99 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 8.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 23089.1ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1090.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8566.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 45 SDtfs, 22 SDslu, 16 SDs, 0 SdLazy, 205 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 263.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 242.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=310occurred in iteration=10, InterpolantAutomatonStates: 52, 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: 45.1ms SsaConstructionTime, 412.2ms SatisfiabilityAnalysisTime, 785.1ms InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...