/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:37:33,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:37:33,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:37:33,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:37:33,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:37:33,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:37:33,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:37:33,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:37:33,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:37:33,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:37:33,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:37:33,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:37:33,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:37:33,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:37:33,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:37:33,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:37:33,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:37:33,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:37:33,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:37:33,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:37:33,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:37:33,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:37:33,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:37:33,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:37:33,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:37:33,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:37:33,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:37:33,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:37:33,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:37:33,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:37:33,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:37:33,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:37:33,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:37:33,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:37:33,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:37:33,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:37:33,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:37:33,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:37:33,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:37:33,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:37:33,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:37:33,684 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:37:33,702 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:37:33,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:37:33,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:37:33,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:37:33,704 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:37:33,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:37:33,705 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:37:33,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:37:33,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:37:33,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:37:33,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:37:33,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:37:33,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:37:33,706 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:37:33,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:37:33,706 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:37:33,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:37:33,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:37:33,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:37:33,707 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:37:33,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:37:33,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:37:33,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:37:33,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:37:33,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:37:33,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:37:33,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:37:33,708 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:37:33,709 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:37:33,709 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:37:33,709 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:37:34,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:37:34,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:37:34,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:37:34,056 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:37:34,064 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:37:34,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i [2021-03-26 00:37:34,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dba479ecd/6e34f650d69e43feb479efbe41caba66/FLAGfac92405c [2021-03-26 00:37:34,634 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:37:34,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i [2021-03-26 00:37:34,656 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dba479ecd/6e34f650d69e43feb479efbe41caba66/FLAGfac92405c [2021-03-26 00:37:34,945 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dba479ecd/6e34f650d69e43feb479efbe41caba66 [2021-03-26 00:37:34,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:37:34,949 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:37:34,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:37:34,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:37:34,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:37:34,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:37:34" (1/1) ... [2021-03-26 00:37:34,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7a009f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:34, skipping insertion in model container [2021-03-26 00:37:34,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:37:34" (1/1) ... [2021-03-26 00:37:34,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:37:35,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:37:35,184 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/safe008_rmo.oepc.i[950,963] [2021-03-26 00:37:35,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:37:35,376 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:37:35,385 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/safe008_rmo.oepc.i[950,963] [2021-03-26 00:37:35,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:37:35,505 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:37:35,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:35 WrapperNode [2021-03-26 00:37:35,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:37:35,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:37:35,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:37:35,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:37:35,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:35" (1/1) ... [2021-03-26 00:37:35,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:35" (1/1) ... [2021-03-26 00:37:35,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:37:35,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:37:35,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:37:35,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:37:35,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:35" (1/1) ... [2021-03-26 00:37:35,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:35" (1/1) ... [2021-03-26 00:37:35,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:35" (1/1) ... [2021-03-26 00:37:35,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:35" (1/1) ... [2021-03-26 00:37:35,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:35" (1/1) ... [2021-03-26 00:37:35,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:35" (1/1) ... [2021-03-26 00:37:35,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:35" (1/1) ... [2021-03-26 00:37:35,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:37:35,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:37:35,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:37:35,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:37:35,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:37:35,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:37:35,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:37:35,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:37:35,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:37:35,699 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:37:35,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:37:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:37:35,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:37:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:37:35,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:37:35,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:37:35,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:37:35,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:37:35,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:37:35,703 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:37:37,458 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:37:37,459 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:37:37,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:37:37 BoogieIcfgContainer [2021-03-26 00:37:37,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:37:37,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:37:37,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:37:37,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:37:37,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:37:34" (1/3) ... [2021-03-26 00:37:37,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733bfd66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:37:37, skipping insertion in model container [2021-03-26 00:37:37,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:35" (2/3) ... [2021-03-26 00:37:37,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733bfd66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:37:37, skipping insertion in model container [2021-03-26 00:37:37,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:37:37" (3/3) ... [2021-03-26 00:37:37,470 INFO L111 eAbstractionObserver]: Analyzing ICFG safe008_rmo.oepc.i [2021-03-26 00:37:37,476 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:37:37,480 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:37:37,481 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:37:37,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,514 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,514 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,515 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,515 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,515 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,517 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,517 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,517 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,522 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,522 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,523 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,523 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,527 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,527 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,528 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,528 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,534 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,534 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,537 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,540 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,548 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,549 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,549 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:37,550 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:37:37,566 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:37:37,592 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:37:37,593 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:37:37,593 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:37:37,593 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:37:37,593 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:37:37,593 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:37:37,593 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:37:37,593 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:37:37,608 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-03-26 00:37:37,654 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-26 00:37:37,654 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:37:37,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:37:37,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-03-26 00:37:37,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-03-26 00:37:37,674 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:37,686 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-26 00:37:37,688 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-26 00:37:37,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-03-26 00:37:37,744 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-26 00:37:37,745 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:37:37,746 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:37:37,751 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-26 00:37:38,618 WARN L205 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-03-26 00:37:38,920 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 00:37:40,305 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-26 00:37:40,905 WARN L205 SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 00:37:41,972 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:37:42,341 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:37:42,449 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:37:43,808 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-26 00:37:44,076 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 00:37:44,615 WARN L205 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:37:45,242 WARN L205 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:37:45,393 INFO L154 LiptonReduction]: Checked pairs total: 3189 [2021-03-26 00:37:45,393 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-26 00:37:45,395 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7721 [2021-03-26 00:37:45,410 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 00:37:45,410 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:37:45,410 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:45,411 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:45,411 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:45,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:45,417 INFO L82 PathProgramCache]: Analyzing trace with hash -351657079, now seen corresponding path program 1 times [2021-03-26 00:37:45,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:45,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219372799] [2021-03-26 00:37:45,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:45,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:45,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:37:45,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:45,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:45,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219372799] [2021-03-26 00:37:45,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:45,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:37:45,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107463586] [2021-03-26 00:37:45,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:37:45,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:45,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:37:45,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:37:45,626 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 162 [2021-03-26 00:37:45,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:45,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:45,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 162 [2021-03-26 00:37:45,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:45,762 INFO L129 PetriNetUnfolder]: 69/188 cut-off events. [2021-03-26 00:37:45,762 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:37:45,764 INFO L84 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 188 events. 69/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 906 event pairs, 13 based on Foata normal form. 11/181 useless extension candidates. Maximal degree in co-relation 294. Up to 89 conditions per place. [2021-03-26 00:37:45,765 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 9 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2021-03-26 00:37:45,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 43 transitions, 121 flow [2021-03-26 00:37:45,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:37:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:37:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2021-03-26 00:37:45,782 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8847736625514403 [2021-03-26 00:37:45,783 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2021-03-26 00:37:45,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2021-03-26 00:37:45,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:45,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2021-03-26 00:37:45,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:45,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:45,802 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:45,804 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 91 flow. Second operand 3 states and 430 transitions. [2021-03-26 00:37:45,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 43 transitions, 121 flow [2021-03-26 00:37:45,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:37:45,808 INFO L241 Difference]: Finished difference. Result has 47 places, 35 transitions, 80 flow [2021-03-26 00:37:45,810 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2021-03-26 00:37:45,811 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2021-03-26 00:37:45,811 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:45,811 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 80 flow [2021-03-26 00:37:45,812 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 80 flow [2021-03-26 00:37:45,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2021-03-26 00:37:45,817 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-26 00:37:45,817 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:37:45,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:37:45,818 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 00:37:46,286 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:37:46,579 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:37:47,192 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 00:37:47,822 WARN L205 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 00:37:48,839 INFO L154 LiptonReduction]: Checked pairs total: 1218 [2021-03-26 00:37:48,839 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 00:37:48,839 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3028 [2021-03-26 00:37:48,841 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 00:37:48,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:48,841 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:48,841 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:48,842 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:37:48,842 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:48,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:48,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1437678712, now seen corresponding path program 1 times [2021-03-26 00:37:48,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:48,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060347329] [2021-03-26 00:37:48,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:49,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:49,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:37:49,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:49,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:49,013 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:37:49,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:37:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:49,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060347329] [2021-03-26 00:37:49,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:49,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:37:49,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082403352] [2021-03-26 00:37:49,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:37:49,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:49,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:37:49,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:37:49,023 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 173 [2021-03-26 00:37:49,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:49,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:49,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 173 [2021-03-26 00:37:49,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:49,041 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 00:37:49,041 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:37:49,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:37:49,041 INFO L132 encePairwiseOnDemand]: 170/173 looper letters, 1 selfloop transitions, 2 changer transitions 1/24 dead transitions. [2021-03-26 00:37:49,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 64 flow [2021-03-26 00:37:49,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:37:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:37:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2021-03-26 00:37:49,043 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8805394990366089 [2021-03-26 00:37:49,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2021-03-26 00:37:49,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2021-03-26 00:37:49,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:49,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2021-03-26 00:37:49,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:49,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:49,046 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:49,046 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 457 transitions. [2021-03-26 00:37:49,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 64 flow [2021-03-26 00:37:49,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:37:49,047 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 60 flow [2021-03-26 00:37:49,047 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-03-26 00:37:49,047 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -16 predicate places. [2021-03-26 00:37:49,048 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:49,048 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 00:37:49,048 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 00:37:49,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-26 00:37:49,051 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 00:37:49,051 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:37:49,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:37:49,052 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-26 00:37:49,266 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-03-26 00:37:49,821 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 00:37:49,950 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:37:50,241 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 00:37:50,374 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:37:50,377 INFO L154 LiptonReduction]: Checked pairs total: 777 [2021-03-26 00:37:50,377 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:37:50,377 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1329 [2021-03-26 00:37:50,378 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-26 00:37:50,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:50,379 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:50,379 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:50,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:37:50,379 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:50,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:50,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1821539996, now seen corresponding path program 1 times [2021-03-26 00:37:50,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:50,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781958987] [2021-03-26 00:37:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:50,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:50,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:37:50,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:50,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:50,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:50,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:50,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781958987] [2021-03-26 00:37:50,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:50,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:37:50,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946282787] [2021-03-26 00:37:50,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:37:50,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:50,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:37:50,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:37:50,512 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 175 [2021-03-26 00:37:50,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:50,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:50,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 175 [2021-03-26 00:37:50,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:50,536 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 00:37:50,536 INFO L130 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2021-03-26 00:37:50,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 28 events. 0/28 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 3/31 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 00:37:50,536 INFO L132 encePairwiseOnDemand]: 171/175 looper letters, 1 selfloop transitions, 3 changer transitions 1/22 dead transitions. [2021-03-26 00:37:50,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 22 transitions, 71 flow [2021-03-26 00:37:50,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:37:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:37:50,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 611 transitions. [2021-03-26 00:37:50,538 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8728571428571429 [2021-03-26 00:37:50,538 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 611 transitions. [2021-03-26 00:37:50,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 611 transitions. [2021-03-26 00:37:50,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:50,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 611 transitions. [2021-03-26 00:37:50,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:50,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:50,542 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:50,542 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 4 states and 611 transitions. [2021-03-26 00:37:50,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 22 transitions, 71 flow [2021-03-26 00:37:50,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 22 transitions, 65 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:37:50,543 INFO L241 Difference]: Finished difference. Result has 34 places, 21 transitions, 66 flow [2021-03-26 00:37:50,543 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2021-03-26 00:37:50,543 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -16 predicate places. [2021-03-26 00:37:50,544 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:50,544 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 66 flow [2021-03-26 00:37:50,545 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 66 flow [2021-03-26 00:37:50,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 21 transitions, 66 flow [2021-03-26 00:37:50,549 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 00:37:50,549 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 00:37:50,549 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 21 events. 0/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:37:50,549 INFO L142 LiptonReduction]: Number of co-enabled transitions 194 [2021-03-26 00:37:50,733 INFO L154 LiptonReduction]: Checked pairs total: 414 [2021-03-26 00:37:50,733 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:37:50,733 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 189 [2021-03-26 00:37:50,734 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 64 flow [2021-03-26 00:37:50,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:50,735 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:50,735 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:50,735 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:37:50,735 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:50,735 INFO L82 PathProgramCache]: Analyzing trace with hash -821153322, now seen corresponding path program 1 times [2021-03-26 00:37:50,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:50,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472781655] [2021-03-26 00:37:50,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:50,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:50,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:50,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:50,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:50,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472781655] [2021-03-26 00:37:50,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:50,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:37:50,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018375160] [2021-03-26 00:37:50,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:37:50,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:50,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:37:50,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:37:50,794 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 176 [2021-03-26 00:37:50,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:50,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:50,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 176 [2021-03-26 00:37:50,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:50,821 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-26 00:37:50,821 INFO L130 PetriNetUnfolder]: For 22/33 co-relation queries the response was YES. [2021-03-26 00:37:50,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 30 events. 0/30 cut-off events. For 22/33 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 3/33 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 00:37:50,821 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 1 selfloop transitions, 3 changer transitions 1/21 dead transitions. [2021-03-26 00:37:50,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 21 transitions, 80 flow [2021-03-26 00:37:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:37:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:37:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2021-03-26 00:37:50,828 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8508522727272727 [2021-03-26 00:37:50,828 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 599 transitions. [2021-03-26 00:37:50,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 599 transitions. [2021-03-26 00:37:50,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:50,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 599 transitions. [2021-03-26 00:37:50,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:50,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:50,833 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:50,833 INFO L185 Difference]: Start difference. First operand has 33 places, 20 transitions, 64 flow. Second operand 4 states and 599 transitions. [2021-03-26 00:37:50,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 21 transitions, 80 flow [2021-03-26 00:37:50,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 21 transitions, 65 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 00:37:50,834 INFO L241 Difference]: Finished difference. Result has 34 places, 20 transitions, 66 flow [2021-03-26 00:37:50,834 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2021-03-26 00:37:50,835 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -16 predicate places. [2021-03-26 00:37:50,835 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:50,835 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 20 transitions, 66 flow [2021-03-26 00:37:50,835 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 20 transitions, 66 flow [2021-03-26 00:37:50,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 20 transitions, 66 flow [2021-03-26 00:37:50,839 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-26 00:37:50,839 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 00:37:50,839 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 20 events. 0/20 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:37:50,839 INFO L142 LiptonReduction]: Number of co-enabled transitions 146 [2021-03-26 00:37:50,999 INFO L154 LiptonReduction]: Checked pairs total: 281 [2021-03-26 00:37:50,999 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:37:50,999 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 164 [2021-03-26 00:37:51,000 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 64 flow [2021-03-26 00:37:51,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:51,001 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:51,001 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:51,001 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:37:51,001 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:51,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:51,001 INFO L82 PathProgramCache]: Analyzing trace with hash 917533105, now seen corresponding path program 1 times [2021-03-26 00:37:51,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:51,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50477017] [2021-03-26 00:37:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:51,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:51,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:37:51,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:51,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:37:51,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:51,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:37:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:51,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50477017] [2021-03-26 00:37:51,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:51,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:37:51,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654529976] [2021-03-26 00:37:51,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:37:51,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:51,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:37:51,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:37:51,090 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 177 [2021-03-26 00:37:51,091 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:51,091 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:51,091 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 177 [2021-03-26 00:37:51,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:51,157 INFO L129 PetriNetUnfolder]: 52/119 cut-off events. [2021-03-26 00:37:51,157 INFO L130 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2021-03-26 00:37:51,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 119 events. 52/119 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 389 event pairs, 25 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 259. Up to 89 conditions per place. [2021-03-26 00:37:51,158 INFO L132 encePairwiseOnDemand]: 170/177 looper letters, 8 selfloop transitions, 6 changer transitions 0/25 dead transitions. [2021-03-26 00:37:51,158 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 108 flow [2021-03-26 00:37:51,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:37:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:37:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2021-03-26 00:37:51,160 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7838983050847458 [2021-03-26 00:37:51,161 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2021-03-26 00:37:51,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2021-03-26 00:37:51,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:51,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2021-03-26 00:37:51,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:51,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:51,164 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:51,164 INFO L185 Difference]: Start difference. First operand has 33 places, 19 transitions, 64 flow. Second operand 4 states and 555 transitions. [2021-03-26 00:37:51,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 108 flow [2021-03-26 00:37:51,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 25 transitions, 93 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 00:37:51,165 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 94 flow [2021-03-26 00:37:51,166 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2021-03-26 00:37:51,166 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -16 predicate places. [2021-03-26 00:37:51,166 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:51,166 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 94 flow [2021-03-26 00:37:51,166 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 94 flow [2021-03-26 00:37:51,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 94 flow [2021-03-26 00:37:51,177 INFO L129 PetriNetUnfolder]: 29/85 cut-off events. [2021-03-26 00:37:51,177 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-03-26 00:37:51,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 85 events. 29/85 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 310 event pairs, 11 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 168. Up to 52 conditions per place. [2021-03-26 00:37:51,179 INFO L142 LiptonReduction]: Number of co-enabled transitions 146 [2021-03-26 00:37:51,331 INFO L154 LiptonReduction]: Checked pairs total: 123 [2021-03-26 00:37:51,331 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:37:51,331 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 165 [2021-03-26 00:37:51,332 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 96 flow [2021-03-26 00:37:51,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:51,333 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:51,333 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:51,333 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:37:51,333 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:51,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:51,333 INFO L82 PathProgramCache]: Analyzing trace with hash 316192968, now seen corresponding path program 1 times [2021-03-26 00:37:51,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:51,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313299691] [2021-03-26 00:37:51,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:51,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:51,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:37:51,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:51,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:37:51,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:51,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:37:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:51,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313299691] [2021-03-26 00:37:51,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:51,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:37:51,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516105787] [2021-03-26 00:37:51,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:37:51,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:51,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:37:51,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:37:51,451 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 178 [2021-03-26 00:37:51,452 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 96 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 00:37:51,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:51,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 178 [2021-03-26 00:37:51,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:51,514 INFO L129 PetriNetUnfolder]: 49/112 cut-off events. [2021-03-26 00:37:51,514 INFO L130 PetriNetUnfolder]: For 69/86 co-relation queries the response was YES. [2021-03-26 00:37:51,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 112 events. 49/112 cut-off events. For 69/86 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 374 event pairs, 31 based on Foata normal form. 9/118 useless extension candidates. Maximal degree in co-relation 301. Up to 83 conditions per place. [2021-03-26 00:37:51,515 INFO L132 encePairwiseOnDemand]: 171/178 looper letters, 8 selfloop transitions, 9 changer transitions 0/28 dead transitions. [2021-03-26 00:37:51,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 146 flow [2021-03-26 00:37:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:37:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:37:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2021-03-26 00:37:51,519 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7794943820224719 [2021-03-26 00:37:51,519 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2021-03-26 00:37:51,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2021-03-26 00:37:51,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:51,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2021-03-26 00:37:51,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:51,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:51,522 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:51,522 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 96 flow. Second operand 4 states and 555 transitions. [2021-03-26 00:37:51,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 146 flow [2021-03-26 00:37:51,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 141 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:37:51,524 INFO L241 Difference]: Finished difference. Result has 37 places, 27 transitions, 137 flow [2021-03-26 00:37:51,524 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2021-03-26 00:37:51,524 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -13 predicate places. [2021-03-26 00:37:51,525 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:51,525 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 27 transitions, 137 flow [2021-03-26 00:37:51,525 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 137 flow [2021-03-26 00:37:51,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 137 flow [2021-03-26 00:37:51,536 INFO L129 PetriNetUnfolder]: 26/84 cut-off events. [2021-03-26 00:37:51,537 INFO L130 PetriNetUnfolder]: For 42/63 co-relation queries the response was YES. [2021-03-26 00:37:51,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 84 events. 26/84 cut-off events. For 42/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 316 event pairs, 7 based on Foata normal form. 2/82 useless extension candidates. Maximal degree in co-relation 214. Up to 48 conditions per place. [2021-03-26 00:37:51,538 INFO L142 LiptonReduction]: Number of co-enabled transitions 150 [2021-03-26 00:37:51,639 INFO L154 LiptonReduction]: Checked pairs total: 158 [2021-03-26 00:37:51,639 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:37:51,639 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 114 [2021-03-26 00:37:51,640 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 139 flow [2021-03-26 00:37:51,641 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 00:37:51,641 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:51,641 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:51,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:37:51,641 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:51,644 INFO L82 PathProgramCache]: Analyzing trace with hash 356800116, now seen corresponding path program 1 times [2021-03-26 00:37:51,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:51,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592310486] [2021-03-26 00:37:51,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:51,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:51,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:37:51,727 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 00:37:51,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 00:37:51,744 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-26 00:37:51,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 00:37:51,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:51,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:37:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:51,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592310486] [2021-03-26 00:37:51,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:51,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:37:51,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237677027] [2021-03-26 00:37:51,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:37:51,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:51,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:37:51,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:37:51,780 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 179 [2021-03-26 00:37:51,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:51,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:51,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 179 [2021-03-26 00:37:51,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:51,890 INFO L129 PetriNetUnfolder]: 55/131 cut-off events. [2021-03-26 00:37:51,890 INFO L130 PetriNetUnfolder]: For 104/135 co-relation queries the response was YES. [2021-03-26 00:37:51,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 131 events. 55/131 cut-off events. For 104/135 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 537 event pairs, 18 based on Foata normal form. 10/137 useless extension candidates. Maximal degree in co-relation 406. Up to 83 conditions per place. [2021-03-26 00:37:51,893 INFO L132 encePairwiseOnDemand]: 170/179 looper letters, 11 selfloop transitions, 9 changer transitions 0/31 dead transitions. [2021-03-26 00:37:51,893 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 197 flow [2021-03-26 00:37:51,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:37:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:37:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 676 transitions. [2021-03-26 00:37:51,895 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7553072625698324 [2021-03-26 00:37:51,896 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 676 transitions. [2021-03-26 00:37:51,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 676 transitions. [2021-03-26 00:37:51,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:51,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 676 transitions. [2021-03-26 00:37:51,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:51,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:51,899 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:51,899 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 139 flow. Second operand 5 states and 676 transitions. [2021-03-26 00:37:51,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 197 flow [2021-03-26 00:37:51,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 175 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-03-26 00:37:51,901 INFO L241 Difference]: Finished difference. Result has 40 places, 30 transitions, 163 flow [2021-03-26 00:37:51,901 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2021-03-26 00:37:51,901 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2021-03-26 00:37:51,901 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:51,901 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 163 flow [2021-03-26 00:37:51,901 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 163 flow [2021-03-26 00:37:51,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 163 flow [2021-03-26 00:37:51,921 INFO L129 PetriNetUnfolder]: 48/125 cut-off events. [2021-03-26 00:37:51,921 INFO L130 PetriNetUnfolder]: For 98/106 co-relation queries the response was YES. [2021-03-26 00:37:51,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 125 events. 48/125 cut-off events. For 98/106 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 514 event pairs, 8 based on Foata normal form. 2/123 useless extension candidates. Maximal degree in co-relation 345. Up to 75 conditions per place. [2021-03-26 00:37:51,923 INFO L142 LiptonReduction]: Number of co-enabled transitions 164 [2021-03-26 00:37:51,926 INFO L154 LiptonReduction]: Checked pairs total: 63 [2021-03-26 00:37:51,926 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:37:51,926 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-26 00:37:51,927 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 163 flow [2021-03-26 00:37:51,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:51,928 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:51,928 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:51,928 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:37:51,928 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:51,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:51,929 INFO L82 PathProgramCache]: Analyzing trace with hash 306913278, now seen corresponding path program 1 times [2021-03-26 00:37:51,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:51,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443754934] [2021-03-26 00:37:51,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:52,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:52,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:52,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:52,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:52,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:52,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:37:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:52,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443754934] [2021-03-26 00:37:52,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:52,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:37:52,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540427793] [2021-03-26 00:37:52,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:37:52,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:52,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:37:52,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:37:52,024 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 179 [2021-03-26 00:37:52,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:52,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:52,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 179 [2021-03-26 00:37:52,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:52,078 INFO L129 PetriNetUnfolder]: 82/201 cut-off events. [2021-03-26 00:37:52,078 INFO L130 PetriNetUnfolder]: For 119/148 co-relation queries the response was YES. [2021-03-26 00:37:52,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 201 events. 82/201 cut-off events. For 119/148 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 999 event pairs, 29 based on Foata normal form. 21/209 useless extension candidates. Maximal degree in co-relation 507. Up to 99 conditions per place. [2021-03-26 00:37:52,080 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 8 selfloop transitions, 8 changer transitions 0/35 dead transitions. [2021-03-26 00:37:52,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 179 flow [2021-03-26 00:37:52,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:37:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:37:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2021-03-26 00:37:52,082 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.846927374301676 [2021-03-26 00:37:52,082 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2021-03-26 00:37:52,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2021-03-26 00:37:52,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:52,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2021-03-26 00:37:52,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:52,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:52,086 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:52,086 INFO L185 Difference]: Start difference. First operand has 40 places, 30 transitions, 163 flow. Second operand 5 states and 758 transitions. [2021-03-26 00:37:52,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 179 flow [2021-03-26 00:37:52,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 156 flow, removed 2 selfloop flow, removed 6 redundant places. [2021-03-26 00:37:52,089 INFO L241 Difference]: Finished difference. Result has 41 places, 32 transitions, 164 flow [2021-03-26 00:37:52,089 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2021-03-26 00:37:52,089 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2021-03-26 00:37:52,090 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:52,090 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 164 flow [2021-03-26 00:37:52,090 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 164 flow [2021-03-26 00:37:52,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 164 flow [2021-03-26 00:37:52,113 INFO L129 PetriNetUnfolder]: 87/207 cut-off events. [2021-03-26 00:37:52,114 INFO L130 PetriNetUnfolder]: For 209/237 co-relation queries the response was YES. [2021-03-26 00:37:52,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 207 events. 87/207 cut-off events. For 209/237 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 997 event pairs, 34 based on Foata normal form. 7/201 useless extension candidates. Maximal degree in co-relation 612. Up to 98 conditions per place. [2021-03-26 00:37:52,116 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-26 00:37:52,270 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-03-26 00:37:52,635 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-03-26 00:37:52,694 INFO L154 LiptonReduction]: Checked pairs total: 20 [2021-03-26 00:37:52,695 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:37:52,695 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 605 [2021-03-26 00:37:52,695 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 160 flow [2021-03-26 00:37:52,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:52,696 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:52,696 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:52,696 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:37:52,696 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:52,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:52,697 INFO L82 PathProgramCache]: Analyzing trace with hash 846525489, now seen corresponding path program 1 times [2021-03-26 00:37:52,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:52,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670218796] [2021-03-26 00:37:52,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:52,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:52,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:52,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:52,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:52,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:52,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:52,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:52,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:37:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:52,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670218796] [2021-03-26 00:37:52,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:52,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:37:52,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365913463] [2021-03-26 00:37:52,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:37:52,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:52,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:37:52,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:37:52,763 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 180 [2021-03-26 00:37:52,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:52,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:52,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 180 [2021-03-26 00:37:52,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:52,818 INFO L129 PetriNetUnfolder]: 37/119 cut-off events. [2021-03-26 00:37:52,818 INFO L130 PetriNetUnfolder]: For 161/178 co-relation queries the response was YES. [2021-03-26 00:37:52,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 119 events. 37/119 cut-off events. For 161/178 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 477 event pairs, 5 based on Foata normal form. 24/136 useless extension candidates. Maximal degree in co-relation 400. Up to 65 conditions per place. [2021-03-26 00:37:52,820 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 5 selfloop transitions, 11 changer transitions 3/38 dead transitions. [2021-03-26 00:37:52,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 238 flow [2021-03-26 00:37:52,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:37:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:37:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 915 transitions. [2021-03-26 00:37:52,823 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8472222222222222 [2021-03-26 00:37:52,823 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 915 transitions. [2021-03-26 00:37:52,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 915 transitions. [2021-03-26 00:37:52,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:52,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 915 transitions. [2021-03-26 00:37:52,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:52,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:52,827 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:52,827 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 160 flow. Second operand 6 states and 915 transitions. [2021-03-26 00:37:52,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 238 flow [2021-03-26 00:37:52,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 38 transitions, 225 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-26 00:37:52,830 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 217 flow [2021-03-26 00:37:52,830 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2021-03-26 00:37:52,831 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2021-03-26 00:37:52,831 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:52,831 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 217 flow [2021-03-26 00:37:52,831 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 217 flow [2021-03-26 00:37:52,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 217 flow [2021-03-26 00:37:52,846 INFO L129 PetriNetUnfolder]: 35/116 cut-off events. [2021-03-26 00:37:52,847 INFO L130 PetriNetUnfolder]: For 214/231 co-relation queries the response was YES. [2021-03-26 00:37:52,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 116 events. 35/116 cut-off events. For 214/231 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 3 based on Foata normal form. 1/113 useless extension candidates. Maximal degree in co-relation 402. Up to 62 conditions per place. [2021-03-26 00:37:52,848 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-26 00:37:52,854 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-26 00:37:52,854 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:37:52,854 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-26 00:37:52,855 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 209 flow [2021-03-26 00:37:52,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:52,855 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:52,855 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:52,856 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:37:52,856 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:52,857 INFO L82 PathProgramCache]: Analyzing trace with hash 490561210, now seen corresponding path program 1 times [2021-03-26 00:37:52,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:52,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788070023] [2021-03-26 00:37:52,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:52,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:52,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:52,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:52,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:52,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:52,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:52,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:52,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:52,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:52,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:37:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:52,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788070023] [2021-03-26 00:37:52,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:52,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:37:52,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516725304] [2021-03-26 00:37:52,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:37:52,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:52,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:37:52,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:37:52,941 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 180 [2021-03-26 00:37:52,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:52,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:52,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 180 [2021-03-26 00:37:52,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:52,997 INFO L129 PetriNetUnfolder]: 21/73 cut-off events. [2021-03-26 00:37:52,997 INFO L130 PetriNetUnfolder]: For 145/162 co-relation queries the response was YES. [2021-03-26 00:37:52,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 73 events. 21/73 cut-off events. For 145/162 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 222 event pairs, 1 based on Foata normal form. 15/84 useless extension candidates. Maximal degree in co-relation 261. Up to 36 conditions per place. [2021-03-26 00:37:52,998 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 2 selfloop transitions, 11 changer transitions 3/35 dead transitions. [2021-03-26 00:37:52,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 35 transitions, 241 flow [2021-03-26 00:37:52,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:37:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:37:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1061 transitions. [2021-03-26 00:37:53,001 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8420634920634921 [2021-03-26 00:37:53,001 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1061 transitions. [2021-03-26 00:37:53,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1061 transitions. [2021-03-26 00:37:53,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:53,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1061 transitions. [2021-03-26 00:37:53,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 151.57142857142858) internal successors, (1061), 7 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:53,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:53,007 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:53,008 INFO L185 Difference]: Start difference. First operand has 44 places, 34 transitions, 209 flow. Second operand 7 states and 1061 transitions. [2021-03-26 00:37:53,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 35 transitions, 241 flow [2021-03-26 00:37:53,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 212 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-26 00:37:53,011 INFO L241 Difference]: Finished difference. Result has 47 places, 32 transitions, 192 flow [2021-03-26 00:37:53,012 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2021-03-26 00:37:53,012 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2021-03-26 00:37:53,012 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:53,012 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 32 transitions, 192 flow [2021-03-26 00:37:53,012 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 32 transitions, 192 flow [2021-03-26 00:37:53,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 32 transitions, 192 flow [2021-03-26 00:37:53,023 INFO L129 PetriNetUnfolder]: 19/70 cut-off events. [2021-03-26 00:37:53,023 INFO L130 PetriNetUnfolder]: For 100/105 co-relation queries the response was YES. [2021-03-26 00:37:53,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 70 events. 19/70 cut-off events. For 100/105 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 207 event pairs, 1 based on Foata normal form. 1/68 useless extension candidates. Maximal degree in co-relation 225. Up to 21 conditions per place. [2021-03-26 00:37:53,024 INFO L142 LiptonReduction]: Number of co-enabled transitions 124 [2021-03-26 00:37:53,334 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:37:53,467 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:37:54,104 WARN L205 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 192 [2021-03-26 00:37:54,331 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:37:55,690 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 347 DAG size of output: 268 [2021-03-26 00:37:56,206 WARN L205 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 250 [2021-03-26 00:37:56,210 INFO L154 LiptonReduction]: Checked pairs total: 14 [2021-03-26 00:37:56,210 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:37:56,210 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3198 [2021-03-26 00:37:56,211 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 176 flow [2021-03-26 00:37:56,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:56,211 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:56,211 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:56,211 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:37:56,211 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:56,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:56,212 INFO L82 PathProgramCache]: Analyzing trace with hash 411730148, now seen corresponding path program 1 times [2021-03-26 00:37:56,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:56,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759749592] [2021-03-26 00:37:56,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:37:56,249 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:37:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:37:56,290 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:37:56,314 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:37:56,314 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:37:56,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:37:56,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:37:56 BasicIcfg [2021-03-26 00:37:56,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:37:56,368 INFO L168 Benchmark]: Toolchain (without parser) took 21419.58 ms. Allocated memory was 255.9 MB in the beginning and 750.8 MB in the end (delta: 494.9 MB). Free memory was 236.8 MB in the beginning and 454.4 MB in the end (delta: -217.5 MB). Peak memory consumption was 276.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:37:56,368 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:37:56,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.63 ms. Allocated memory was 255.9 MB in the beginning and 406.8 MB in the end (delta: 151.0 MB). Free memory was 236.4 MB in the beginning and 365.5 MB in the end (delta: -129.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:37:56,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.16 ms. Allocated memory is still 406.8 MB. Free memory was 365.5 MB in the beginning and 362.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:37:56,369 INFO L168 Benchmark]: Boogie Preprocessor took 42.19 ms. Allocated memory is still 406.8 MB. Free memory was 362.9 MB in the beginning and 360.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:37:56,369 INFO L168 Benchmark]: RCFGBuilder took 1865.10 ms. Allocated memory is still 406.8 MB. Free memory was 360.0 MB in the beginning and 269.8 MB in the end (delta: 90.2 MB). Peak memory consumption was 93.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:37:56,370 INFO L168 Benchmark]: TraceAbstraction took 18903.07 ms. Allocated memory was 406.8 MB in the beginning and 750.8 MB in the end (delta: 343.9 MB). Free memory was 269.8 MB in the beginning and 454.4 MB in the end (delta: -184.5 MB). Peak memory consumption was 160.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:37:56,371 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.20 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 556.63 ms. Allocated memory was 255.9 MB in the beginning and 406.8 MB in the end (delta: 151.0 MB). Free memory was 236.4 MB in the beginning and 365.5 MB in the end (delta: -129.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 46.16 ms. Allocated memory is still 406.8 MB. Free memory was 365.5 MB in the beginning and 362.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 42.19 ms. Allocated memory is still 406.8 MB. Free memory was 362.9 MB in the beginning and 360.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1865.10 ms. Allocated memory is still 406.8 MB. Free memory was 360.0 MB in the beginning and 269.8 MB in the end (delta: 90.2 MB). Peak memory consumption was 93.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18903.07 ms. Allocated memory was 406.8 MB in the beginning and 750.8 MB in the end (delta: 343.9 MB). Free memory was 269.8 MB in the beginning and 454.4 MB in the end (delta: -184.5 MB). Peak memory consumption was 160.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7705.1ms, 103 PlacesBefore, 50 PlacesAfterwards, 95 TransitionsBefore, 41 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 5 FixpointIterations, 24 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 3189 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1640, positive: 1555, positive conditional: 1555, positive unconditional: 0, negative: 85, negative conditional: 85, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1218, positive: 1181, positive conditional: 0, positive unconditional: 1181, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1218, positive: 1181, positive conditional: 0, positive unconditional: 1181, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1218, positive: 1175, positive conditional: 0, positive unconditional: 1175, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 510, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 491, negative conditional: 0, negative unconditional: 491, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1640, positive: 374, positive conditional: 374, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 1218, unknown conditional: 1218, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 70, Positive conditional cache size: 70, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3027.1ms, 47 PlacesBefore, 33 PlacesAfterwards, 35 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 4 FixpointIterations, 10 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1218 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 329, positive: 242, positive conditional: 242, positive unconditional: 0, negative: 87, negative conditional: 87, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, positive: 42, positive conditional: 9, positive unconditional: 33, negative: 17, negative conditional: 3, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, positive: 42, positive conditional: 9, positive unconditional: 33, negative: 17, negative conditional: 3, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 17, negative conditional: 3, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 353, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 353, negative conditional: 52, negative unconditional: 301, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 329, positive: 200, positive conditional: 200, positive unconditional: 0, negative: 70, negative conditional: 70, negative unconditional: 0, unknown: 59, unknown conditional: 59, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 96, Positive conditional cache size: 96, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1329.1ms, 34 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 777 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 291, positive: 231, positive conditional: 231, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 10, negative conditional: 2, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 10, negative conditional: 2, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 10, negative conditional: 2, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 137, negative conditional: 20, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 291, positive: 202, positive conditional: 202, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 39, unknown conditional: 39, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 125, Positive conditional cache size: 125, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 188.2ms, 34 PlacesBefore, 33 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 414 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 130, positive: 96, positive conditional: 96, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, positive: 22, positive conditional: 14, positive unconditional: 8, negative: 7, negative conditional: 2, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, positive: 22, positive conditional: 14, positive unconditional: 8, negative: 7, negative conditional: 2, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 2, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 153, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 153, negative conditional: 12, negative unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 130, positive: 74, positive conditional: 74, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 80, Positive conditional cache size: 80, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 163.7ms, 34 PlacesBefore, 33 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 281 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 122, positive: 94, positive conditional: 94, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 22, positive conditional: 14, positive unconditional: 8, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, positive: 22, positive conditional: 14, positive unconditional: 8, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, positive: 72, positive conditional: 72, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 58, Positive conditional cache size: 58, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 164.9ms, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 123 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 13, positive conditional: 8, positive unconditional: 5, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 13, positive conditional: 8, positive unconditional: 5, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 118, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 118, negative conditional: 27, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 64, Positive conditional cache size: 64, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 114.1ms, 37 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 158 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 8, positive unconditional: 4, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 8, positive unconditional: 4, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 76, negative conditional: 30, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 75, Positive conditional cache size: 75, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.3ms, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 63 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 3, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 3, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 86, Positive conditional cache size: 86, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 604.7ms, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 20 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 19, 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: 19, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 59, Positive conditional cache size: 59, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.1ms, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 59, Positive conditional cache size: 59, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3197.6ms, 47 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 28 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 14 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, 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: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 28, Positive conditional cache size: 28, Positive unconditional cache size: 0, Negative cache size: 9, Negative conditional cache size: 9, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1973; [L821] FCALL, FORK 0 pthread_create(&t1973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t1974; [L823] FCALL, FORK 0 pthread_create(&t1974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 0 pthread_t t1975; [L825] FCALL, FORK 0 pthread_create(&t1975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 __unbuffered_p2_EAX = y [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L843] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L844] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L845] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L845] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L847] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L847] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L848] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18727.1ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 770.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7812.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 35 SDtfs, 14 SDslu, 16 SDs, 0 SdLazy, 199 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 250.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 180.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=9, InterpolantAutomatonStates: 45, 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: 38.5ms SsaConstructionTime, 390.1ms SatisfiabilityAnalysisTime, 634.8ms InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 651 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...