/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:14:09,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:14:09,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:14:09,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:14:09,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:14:09,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:14:09,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:14:09,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:14:09,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:14:09,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:14:09,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:14:09,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:14:09,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:14:09,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:14:09,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:14:09,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:14:09,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:14:09,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:14:09,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:14:09,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:14:09,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:14:09,217 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:14:09,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:14:09,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:14:09,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:14:09,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:14:09,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:14:09,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:14:09,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:14:09,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:14:09,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:14:09,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:14:09,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:14:09,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:14:09,228 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:14:09,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:14:09,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:14:09,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:14:09,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:14:09,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:14:09,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:14:09,233 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:14:09,259 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:14:09,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:14:09,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:14:09,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:14:09,262 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:14:09,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:14:09,262 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:14:09,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:14:09,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:14:09,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:14:09,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:14:09,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:14:09,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:14:09,263 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:14:09,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:14:09,263 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:14:09,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:14:09,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:14:09,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:14:09,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:14:09,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:14:09,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:14:09,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:14:09,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:14:09,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:14:09,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:14:09,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:14:09,264 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:14:09,265 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:14:09,265 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:14:09,265 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:14:09,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:14:09,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:14:09,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:14:09,485 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:14:09,486 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:14:09,486 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i [2021-03-26 10:14:09,526 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94927f564/441a44e826dc4ef29d6e0e3c7dd5cfd9/FLAG83398bb01 [2021-03-26 10:14:09,968 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:14:09,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i [2021-03-26 10:14:09,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94927f564/441a44e826dc4ef29d6e0e3c7dd5cfd9/FLAG83398bb01 [2021-03-26 10:14:10,301 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94927f564/441a44e826dc4ef29d6e0e3c7dd5cfd9 [2021-03-26 10:14:10,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:14:10,305 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:14:10,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:14:10,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:14:10,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:14:10,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:14:10" (1/1) ... [2021-03-26 10:14:10,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1737bb3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:10, skipping insertion in model container [2021-03-26 10:14:10,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:14:10" (1/1) ... [2021-03-26 10:14:10,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:14:10,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:14:10,422 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/mix054_rmo.opt.i[948,961] [2021-03-26 10:14:10,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:14:10,593 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:14:10,600 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/mix054_rmo.opt.i[948,961] [2021-03-26 10:14:10,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:14:10,686 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:14:10,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:10 WrapperNode [2021-03-26 10:14:10,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:14:10,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:14:10,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:14:10,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:14:10,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:10" (1/1) ... [2021-03-26 10:14:10,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:10" (1/1) ... [2021-03-26 10:14:10,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:14:10,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:14:10,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:14:10,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:14:10,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:10" (1/1) ... [2021-03-26 10:14:10,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:10" (1/1) ... [2021-03-26 10:14:10,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:10" (1/1) ... [2021-03-26 10:14:10,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:10" (1/1) ... [2021-03-26 10:14:10,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:10" (1/1) ... [2021-03-26 10:14:10,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:10" (1/1) ... [2021-03-26 10:14:10,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:10" (1/1) ... [2021-03-26 10:14:10,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:14:10,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:14:10,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:14:10,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:14:10,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:14:10,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:14:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:14:10,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:14:10,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:14:10,806 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:14:10,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:14:10,808 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:14:10,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:14:10,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:14:10,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:14:10,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:14:10,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:14:10,810 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:14:11,896 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:14:11,896 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:14:11,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:14:11 BoogieIcfgContainer [2021-03-26 10:14:11,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:14:11,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:14:11,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:14:11,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:14:11,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:14:10" (1/3) ... [2021-03-26 10:14:11,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ac2152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:14:11, skipping insertion in model container [2021-03-26 10:14:11,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:10" (2/3) ... [2021-03-26 10:14:11,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ac2152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:14:11, skipping insertion in model container [2021-03-26 10:14:11,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:14:11" (3/3) ... [2021-03-26 10:14:11,903 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_rmo.opt.i [2021-03-26 10:14:11,909 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:14:11,912 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:14:11,912 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:14:11,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,934 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,934 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,938 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,938 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,938 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,938 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,938 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,939 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,939 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,939 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,943 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,943 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,944 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,945 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,945 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:11,946 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:14:11,957 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 10:14:11,976 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:14:11,976 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:14:11,976 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:14:11,976 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:14:11,976 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:14:11,976 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:14:11,976 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:14:11,977 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:14:11,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2021-03-26 10:14:12,004 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-26 10:14:12,004 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:12,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 10:14:12,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2021-03-26 10:14:12,009 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2021-03-26 10:14:12,010 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:12,018 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-26 10:14:12,020 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-26 10:14:12,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2021-03-26 10:14:12,030 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-26 10:14:12,030 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:12,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 10:14:12,032 INFO L142 LiptonReduction]: Number of co-enabled transitions 918 [2021-03-26 10:14:12,747 WARN L205 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-03-26 10:14:13,015 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-03-26 10:14:14,156 WARN L205 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-03-26 10:14:14,654 WARN L205 SmtUtils]: Spent 495.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-03-26 10:14:15,341 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:14:15,664 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-26 10:14:15,800 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 10:14:16,640 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 10:14:16,892 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 10:14:17,886 WARN L205 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 262 [2021-03-26 10:14:18,409 WARN L205 SmtUtils]: Spent 521.00 ms on a formula simplification that was a NOOP. DAG size: 262 [2021-03-26 10:14:18,682 INFO L154 LiptonReduction]: Checked pairs total: 1544 [2021-03-26 10:14:18,682 INFO L156 LiptonReduction]: Total number of compositions: 56 [2021-03-26 10:14:18,683 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6674 [2021-03-26 10:14:18,689 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 10:14:18,689 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:18,689 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:18,690 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:18,690 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:18,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:18,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1685503753, now seen corresponding path program 1 times [2021-03-26 10:14:18,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:18,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922579116] [2021-03-26 10:14:18,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:18,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:18,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:18,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:18,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:18,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922579116] [2021-03-26 10:14:18,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:18,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:14:18,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145057661] [2021-03-26 10:14:18,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:14:18,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:18,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:14:18,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:14:18,876 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2021-03-26 10:14:18,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:18,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:18,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2021-03-26 10:14:18,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:18,932 INFO L129 PetriNetUnfolder]: 23/91 cut-off events. [2021-03-26 10:14:18,932 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:18,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 91 events. 23/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 335 event pairs, 9 based on Foata normal form. 6/90 useless extension candidates. Maximal degree in co-relation 131. Up to 37 conditions per place. [2021-03-26 10:14:18,935 INFO L132 encePairwiseOnDemand]: 132/136 looper letters, 7 selfloop transitions, 2 changer transitions 5/31 dead transitions. [2021-03-26 10:14:18,935 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 90 flow [2021-03-26 10:14:18,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:14:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:14:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2021-03-26 10:14:18,946 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8725490196078431 [2021-03-26 10:14:18,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2021-03-26 10:14:18,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2021-03-26 10:14:18,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:18,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2021-03-26 10:14:18,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:18,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 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 10:14:18,961 INFO L81 ComplementDD]: Finished complementDD. Result 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 10:14:18,962 INFO L185 Difference]: Start difference. First operand has 36 places, 30 transitions, 66 flow. Second operand 3 states and 356 transitions. [2021-03-26 10:14:18,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 90 flow [2021-03-26 10:14:18,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:14:18,965 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 54 flow [2021-03-26 10:14:18,966 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-03-26 10:14:18,966 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2021-03-26 10:14:18,966 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:18,966 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 54 flow [2021-03-26 10:14:18,967 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 54 flow [2021-03-26 10:14:18,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 54 flow [2021-03-26 10:14:18,973 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 10:14:18,973 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:18,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:14:18,974 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-26 10:14:19,720 WARN L205 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 184 [2021-03-26 10:14:19,971 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 10:14:20,506 WARN L205 SmtUtils]: Spent 533.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:14:21,059 WARN L205 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:14:21,766 INFO L154 LiptonReduction]: Checked pairs total: 536 [2021-03-26 10:14:21,766 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-26 10:14:21,766 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2800 [2021-03-26 10:14:21,767 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2021-03-26 10:14:21,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:21,767 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:21,767 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:21,767 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:14:21,767 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:21,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:21,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1168850318, now seen corresponding path program 1 times [2021-03-26 10:14:21,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:21,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670619644] [2021-03-26 10:14:21,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:21,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:21,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:21,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:21,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:21,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:21,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:21,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:21,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:21,920 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:14:21,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:14:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:21,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670619644] [2021-03-26 10:14:21,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:21,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:14:21,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779155550] [2021-03-26 10:14:21,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:21,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:21,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:21,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:21,926 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 143 [2021-03-26 10:14:21,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:21,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:21,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 143 [2021-03-26 10:14:21,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:21,963 INFO L129 PetriNetUnfolder]: 24/69 cut-off events. [2021-03-26 10:14:21,963 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-26 10:14:21,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 69 events. 24/69 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 236 event pairs, 11 based on Foata normal form. 2/69 useless extension candidates. Maximal degree in co-relation 124. Up to 45 conditions per place. [2021-03-26 10:14:21,964 INFO L132 encePairwiseOnDemand]: 138/143 looper letters, 8 selfloop transitions, 5 changer transitions 0/22 dead transitions. [2021-03-26 10:14:21,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 22 transitions, 80 flow [2021-03-26 10:14:21,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:21,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2021-03-26 10:14:21,966 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7395104895104895 [2021-03-26 10:14:21,967 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2021-03-26 10:14:21,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2021-03-26 10:14:21,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:21,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2021-03-26 10:14:21,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:21,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:21,972 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:21,972 INFO L185 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 4 states and 423 transitions. [2021-03-26 10:14:21,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 22 transitions, 80 flow [2021-03-26 10:14:21,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 22 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:14:21,972 INFO L241 Difference]: Finished difference. Result has 26 places, 20 transitions, 70 flow [2021-03-26 10:14:21,973 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2021-03-26 10:14:21,973 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -10 predicate places. [2021-03-26 10:14:21,973 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:21,973 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 20 transitions, 70 flow [2021-03-26 10:14:21,973 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 70 flow [2021-03-26 10:14:21,973 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 70 flow [2021-03-26 10:14:21,977 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2021-03-26 10:14:21,977 INFO L130 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2021-03-26 10:14:21,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 29 events. 3/29 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 55 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 47. Up to 8 conditions per place. [2021-03-26 10:14:21,977 INFO L142 LiptonReduction]: Number of co-enabled transitions 104 [2021-03-26 10:14:22,193 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-26 10:14:22,521 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-26 10:14:22,632 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 10:14:22,634 INFO L154 LiptonReduction]: Checked pairs total: 236 [2021-03-26 10:14:22,634 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:14:22,634 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 661 [2021-03-26 10:14:22,635 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 68 flow [2021-03-26 10:14:22,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:22,637 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:22,637 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:22,637 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:14:22,637 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:22,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:22,638 INFO L82 PathProgramCache]: Analyzing trace with hash 827853793, now seen corresponding path program 1 times [2021-03-26 10:14:22,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:22,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377800673] [2021-03-26 10:14:22,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:22,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:22,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:22,718 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:14:22,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:22,721 INFO L142 QuantifierPusher]: treesize reduction 11, result has 60.7 percent of original size [2021-03-26 10:14:22,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:14:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:22,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377800673] [2021-03-26 10:14:22,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:22,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:14:22,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130763794] [2021-03-26 10:14:22,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:22,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:22,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:22,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:22,736 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 144 [2021-03-26 10:14:22,737 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:22,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:22,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 144 [2021-03-26 10:14:22,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:22,777 INFO L129 PetriNetUnfolder]: 25/70 cut-off events. [2021-03-26 10:14:22,777 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-03-26 10:14:22,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 70 events. 25/70 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 247 event pairs, 7 based on Foata normal form. 1/71 useless extension candidates. Maximal degree in co-relation 166. Up to 40 conditions per place. [2021-03-26 10:14:22,778 INFO L132 encePairwiseOnDemand]: 138/144 looper letters, 10 selfloop transitions, 7 changer transitions 0/25 dead transitions. [2021-03-26 10:14:22,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 120 flow [2021-03-26 10:14:22,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2021-03-26 10:14:22,780 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.796875 [2021-03-26 10:14:22,780 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 459 transitions. [2021-03-26 10:14:22,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 459 transitions. [2021-03-26 10:14:22,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:22,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 459 transitions. [2021-03-26 10:14:22,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:22,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:22,783 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:22,783 INFO L185 Difference]: Start difference. First operand has 25 places, 19 transitions, 68 flow. Second operand 4 states and 459 transitions. [2021-03-26 10:14:22,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 120 flow [2021-03-26 10:14:22,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:14:22,784 INFO L241 Difference]: Finished difference. Result has 29 places, 22 transitions, 100 flow [2021-03-26 10:14:22,784 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2021-03-26 10:14:22,784 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2021-03-26 10:14:22,784 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:22,784 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 22 transitions, 100 flow [2021-03-26 10:14:22,785 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 100 flow [2021-03-26 10:14:22,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 100 flow [2021-03-26 10:14:22,794 INFO L129 PetriNetUnfolder]: 19/57 cut-off events. [2021-03-26 10:14:22,794 INFO L130 PetriNetUnfolder]: For 36/39 co-relation queries the response was YES. [2021-03-26 10:14:22,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 57 events. 19/57 cut-off events. For 36/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 181 event pairs, 6 based on Foata normal form. 1/56 useless extension candidates. Maximal degree in co-relation 135. Up to 26 conditions per place. [2021-03-26 10:14:22,795 INFO L142 LiptonReduction]: Number of co-enabled transitions 102 [2021-03-26 10:14:22,796 INFO L154 LiptonReduction]: Checked pairs total: 74 [2021-03-26 10:14:22,796 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:22,796 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-26 10:14:22,797 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 100 flow [2021-03-26 10:14:22,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:22,797 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:22,797 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:22,797 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:14:22,797 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:22,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:22,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1820958849, now seen corresponding path program 1 times [2021-03-26 10:14:22,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:22,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670845301] [2021-03-26 10:14:22,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:22,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:22,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:22,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:22,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:22,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:22,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:22,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670845301] [2021-03-26 10:14:22,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:22,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:22,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767865893] [2021-03-26 10:14:22,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:22,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:22,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:22,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:22,860 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 144 [2021-03-26 10:14:22,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 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 10:14:22,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:22,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 144 [2021-03-26 10:14:22,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:22,906 INFO L129 PetriNetUnfolder]: 23/63 cut-off events. [2021-03-26 10:14:22,906 INFO L130 PetriNetUnfolder]: For 53/56 co-relation queries the response was YES. [2021-03-26 10:14:22,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 63 events. 23/63 cut-off events. For 53/56 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 11 based on Foata normal form. 4/67 useless extension candidates. Maximal degree in co-relation 192. Up to 39 conditions per place. [2021-03-26 10:14:22,909 INFO L132 encePairwiseOnDemand]: 139/144 looper letters, 10 selfloop transitions, 8 changer transitions 0/26 dead transitions. [2021-03-26 10:14:22,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 158 flow [2021-03-26 10:14:22,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2021-03-26 10:14:22,911 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7743055555555556 [2021-03-26 10:14:22,911 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 446 transitions. [2021-03-26 10:14:22,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 446 transitions. [2021-03-26 10:14:22,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:22,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 446 transitions. [2021-03-26 10:14:22,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:22,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:22,913 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:22,913 INFO L185 Difference]: Start difference. First operand has 29 places, 22 transitions, 100 flow. Second operand 4 states and 446 transitions. [2021-03-26 10:14:22,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 158 flow [2021-03-26 10:14:22,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 151 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:22,916 INFO L241 Difference]: Finished difference. Result has 32 places, 24 transitions, 128 flow [2021-03-26 10:14:22,916 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2021-03-26 10:14:22,916 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2021-03-26 10:14:22,916 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:22,916 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 24 transitions, 128 flow [2021-03-26 10:14:22,916 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 24 transitions, 128 flow [2021-03-26 10:14:22,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 24 transitions, 128 flow [2021-03-26 10:14:22,922 INFO L129 PetriNetUnfolder]: 17/55 cut-off events. [2021-03-26 10:14:22,922 INFO L130 PetriNetUnfolder]: For 71/75 co-relation queries the response was YES. [2021-03-26 10:14:22,922 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 55 events. 17/55 cut-off events. For 71/75 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 170 event pairs, 4 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 150. Up to 26 conditions per place. [2021-03-26 10:14:22,922 INFO L142 LiptonReduction]: Number of co-enabled transitions 100 [2021-03-26 10:14:23,094 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:14:23,460 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-26 10:14:23,569 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 10:14:23,588 INFO L154 LiptonReduction]: Checked pairs total: 159 [2021-03-26 10:14:23,588 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:14:23,588 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 672 [2021-03-26 10:14:23,589 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 133 flow [2021-03-26 10:14:23,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 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 10:14:23,589 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:23,589 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:23,590 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:14:23,590 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:23,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:23,590 INFO L82 PathProgramCache]: Analyzing trace with hash -723476974, now seen corresponding path program 1 times [2021-03-26 10:14:23,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:23,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127276589] [2021-03-26 10:14:23,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:23,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:23,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:23,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:23,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:23,651 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.6 percent of original size [2021-03-26 10:14:23,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-26 10:14:23,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:23,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:14:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:23,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127276589] [2021-03-26 10:14:23,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:23,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:14:23,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761635405] [2021-03-26 10:14:23,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:14:23,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:23,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:14:23,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:14:23,683 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 145 [2021-03-26 10:14:23,683 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:23,683 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:23,683 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 145 [2021-03-26 10:14:23,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:23,744 INFO L129 PetriNetUnfolder]: 26/68 cut-off events. [2021-03-26 10:14:23,745 INFO L130 PetriNetUnfolder]: For 96/104 co-relation queries the response was YES. [2021-03-26 10:14:23,745 INFO L84 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 68 events. 26/68 cut-off events. For 96/104 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 214 event pairs, 5 based on Foata normal form. 4/69 useless extension candidates. Maximal degree in co-relation 234. Up to 41 conditions per place. [2021-03-26 10:14:23,746 INFO L132 encePairwiseOnDemand]: 138/145 looper letters, 12 selfloop transitions, 9 changer transitions 0/29 dead transitions. [2021-03-26 10:14:23,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 203 flow [2021-03-26 10:14:23,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2021-03-26 10:14:23,747 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7420689655172413 [2021-03-26 10:14:23,748 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2021-03-26 10:14:23,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2021-03-26 10:14:23,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:23,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2021-03-26 10:14:23,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:23,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:23,751 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:23,751 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 133 flow. Second operand 5 states and 538 transitions. [2021-03-26 10:14:23,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 203 flow [2021-03-26 10:14:23,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 190 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:23,753 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 157 flow [2021-03-26 10:14:23,753 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2021-03-26 10:14:23,754 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2021-03-26 10:14:23,754 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:23,754 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 157 flow [2021-03-26 10:14:23,754 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 157 flow [2021-03-26 10:14:23,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 157 flow [2021-03-26 10:14:23,761 INFO L129 PetriNetUnfolder]: 21/64 cut-off events. [2021-03-26 10:14:23,761 INFO L130 PetriNetUnfolder]: For 163/168 co-relation queries the response was YES. [2021-03-26 10:14:23,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 64 events. 21/64 cut-off events. For 163/168 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 203 event pairs, 4 based on Foata normal form. 2/63 useless extension candidates. Maximal degree in co-relation 199. Up to 28 conditions per place. [2021-03-26 10:14:23,762 INFO L142 LiptonReduction]: Number of co-enabled transitions 106 [2021-03-26 10:14:23,764 INFO L154 LiptonReduction]: Checked pairs total: 100 [2021-03-26 10:14:23,764 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:23,764 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-26 10:14:23,769 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 157 flow [2021-03-26 10:14:23,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:23,770 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:23,770 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:23,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:14:23,770 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:23,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:23,770 INFO L82 PathProgramCache]: Analyzing trace with hash -878309146, now seen corresponding path program 1 times [2021-03-26 10:14:23,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:23,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493227948] [2021-03-26 10:14:23,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:23,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:23,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:23,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:23,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:23,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:23,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:14:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:23,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493227948] [2021-03-26 10:14:23,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:23,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:14:23,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154269103] [2021-03-26 10:14:23,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:23,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:23,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:23,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:23,864 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 145 [2021-03-26 10:14:23,864 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:23,864 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:23,864 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 145 [2021-03-26 10:14:23,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:23,907 INFO L129 PetriNetUnfolder]: 25/65 cut-off events. [2021-03-26 10:14:23,907 INFO L130 PetriNetUnfolder]: For 173/181 co-relation queries the response was YES. [2021-03-26 10:14:23,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 65 events. 25/65 cut-off events. For 173/181 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 200 event pairs, 6 based on Foata normal form. 2/66 useless extension candidates. Maximal degree in co-relation 244. Up to 43 conditions per place. [2021-03-26 10:14:23,908 INFO L132 encePairwiseOnDemand]: 142/145 looper letters, 14 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2021-03-26 10:14:23,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 199 flow [2021-03-26 10:14:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:14:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:14:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2021-03-26 10:14:23,910 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7586206896551724 [2021-03-26 10:14:23,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2021-03-26 10:14:23,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2021-03-26 10:14:23,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:23,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2021-03-26 10:14:23,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:23,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:23,911 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:23,911 INFO L185 Difference]: Start difference. First operand has 36 places, 26 transitions, 157 flow. Second operand 3 states and 330 transitions. [2021-03-26 10:14:23,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 199 flow [2021-03-26 10:14:23,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 180 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-26 10:14:23,914 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 155 flow [2021-03-26 10:14:23,914 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2021-03-26 10:14:23,915 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2021-03-26 10:14:23,915 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:23,915 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 155 flow [2021-03-26 10:14:23,915 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 155 flow [2021-03-26 10:14:23,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 155 flow [2021-03-26 10:14:23,922 INFO L129 PetriNetUnfolder]: 20/61 cut-off events. [2021-03-26 10:14:23,922 INFO L130 PetriNetUnfolder]: For 154/157 co-relation queries the response was YES. [2021-03-26 10:14:23,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 61 events. 20/61 cut-off events. For 154/157 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 201 event pairs, 4 based on Foata normal form. 1/59 useless extension candidates. Maximal degree in co-relation 192. Up to 27 conditions per place. [2021-03-26 10:14:23,923 INFO L142 LiptonReduction]: Number of co-enabled transitions 106 [2021-03-26 10:14:23,925 INFO L154 LiptonReduction]: Checked pairs total: 108 [2021-03-26 10:14:23,925 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:23,925 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-26 10:14:23,926 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 155 flow [2021-03-26 10:14:23,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:23,926 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:23,926 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:23,927 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:14:23,927 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:23,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:23,927 INFO L82 PathProgramCache]: Analyzing trace with hash 258079436, now seen corresponding path program 2 times [2021-03-26 10:14:23,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:23,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219721166] [2021-03-26 10:14:23,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:23,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:23,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:23,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:23,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:23,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:23,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:24,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:24,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:24,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219721166] [2021-03-26 10:14:24,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:24,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:24,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319965367] [2021-03-26 10:14:24,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:24,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:24,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:24,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:24,028 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 145 [2021-03-26 10:14:24,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:24,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 145 [2021-03-26 10:14:24,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:24,066 INFO L129 PetriNetUnfolder]: 24/72 cut-off events. [2021-03-26 10:14:24,066 INFO L130 PetriNetUnfolder]: For 208/216 co-relation queries the response was YES. [2021-03-26 10:14:24,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 72 events. 24/72 cut-off events. For 208/216 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 260 event pairs, 7 based on Foata normal form. 4/74 useless extension candidates. Maximal degree in co-relation 254. Up to 38 conditions per place. [2021-03-26 10:14:24,066 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 12 selfloop transitions, 9 changer transitions 0/29 dead transitions. [2021-03-26 10:14:24,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 215 flow [2021-03-26 10:14:24,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 457 transitions. [2021-03-26 10:14:24,069 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7879310344827586 [2021-03-26 10:14:24,069 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 457 transitions. [2021-03-26 10:14:24,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 457 transitions. [2021-03-26 10:14:24,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:24,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 457 transitions. [2021-03-26 10:14:24,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.25) internal successors, (457), 4 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 10:14:24,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,071 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,071 INFO L185 Difference]: Start difference. First operand has 36 places, 26 transitions, 155 flow. Second operand 4 states and 457 transitions. [2021-03-26 10:14:24,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 215 flow [2021-03-26 10:14:24,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 203 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:14:24,073 INFO L241 Difference]: Finished difference. Result has 38 places, 28 transitions, 189 flow [2021-03-26 10:14:24,073 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2021-03-26 10:14:24,074 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2021-03-26 10:14:24,074 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:24,074 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 189 flow [2021-03-26 10:14:24,074 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 189 flow [2021-03-26 10:14:24,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 189 flow [2021-03-26 10:14:24,082 INFO L129 PetriNetUnfolder]: 19/62 cut-off events. [2021-03-26 10:14:24,082 INFO L130 PetriNetUnfolder]: For 171/174 co-relation queries the response was YES. [2021-03-26 10:14:24,082 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 62 events. 19/62 cut-off events. For 171/174 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 222 event pairs, 3 based on Foata normal form. 1/59 useless extension candidates. Maximal degree in co-relation 221. Up to 27 conditions per place. [2021-03-26 10:14:24,082 INFO L142 LiptonReduction]: Number of co-enabled transitions 112 [2021-03-26 10:14:24,084 INFO L154 LiptonReduction]: Checked pairs total: 139 [2021-03-26 10:14:24,084 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:24,084 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-26 10:14:24,085 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 189 flow [2021-03-26 10:14:24,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,085 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:24,085 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:24,085 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:14:24,085 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:24,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:24,086 INFO L82 PathProgramCache]: Analyzing trace with hash 263952107, now seen corresponding path program 1 times [2021-03-26 10:14:24,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:24,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898592707] [2021-03-26 10:14:24,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:24,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:24,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:24,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:24,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:24,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:24,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:24,159 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 10:14:24,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 10:14:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:24,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898592707] [2021-03-26 10:14:24,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:24,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:24,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229977398] [2021-03-26 10:14:24,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:24,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:24,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:24,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:24,176 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 145 [2021-03-26 10:14:24,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:24,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 145 [2021-03-26 10:14:24,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:24,242 INFO L129 PetriNetUnfolder]: 26/74 cut-off events. [2021-03-26 10:14:24,242 INFO L130 PetriNetUnfolder]: For 246/254 co-relation queries the response was YES. [2021-03-26 10:14:24,242 INFO L84 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 74 events. 26/74 cut-off events. For 246/254 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 264 event pairs, 3 based on Foata normal form. 3/77 useless extension candidates. Maximal degree in co-relation 307. Up to 42 conditions per place. [2021-03-26 10:14:24,243 INFO L132 encePairwiseOnDemand]: 138/145 looper letters, 14 selfloop transitions, 12 changer transitions 0/34 dead transitions. [2021-03-26 10:14:24,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 281 flow [2021-03-26 10:14:24,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 547 transitions. [2021-03-26 10:14:24,245 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7544827586206897 [2021-03-26 10:14:24,245 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 547 transitions. [2021-03-26 10:14:24,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 547 transitions. [2021-03-26 10:14:24,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:24,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 547 transitions. [2021-03-26 10:14:24,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,248 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,248 INFO L185 Difference]: Start difference. First operand has 38 places, 28 transitions, 189 flow. Second operand 5 states and 547 transitions. [2021-03-26 10:14:24,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 281 flow [2021-03-26 10:14:24,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 253 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-03-26 10:14:24,249 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 229 flow [2021-03-26 10:14:24,250 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2021-03-26 10:14:24,250 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2021-03-26 10:14:24,250 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:24,250 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 229 flow [2021-03-26 10:14:24,250 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 229 flow [2021-03-26 10:14:24,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 229 flow [2021-03-26 10:14:24,260 INFO L129 PetriNetUnfolder]: 19/65 cut-off events. [2021-03-26 10:14:24,260 INFO L130 PetriNetUnfolder]: For 189/192 co-relation queries the response was YES. [2021-03-26 10:14:24,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 65 events. 19/65 cut-off events. For 189/192 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 234 event pairs, 3 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 230. Up to 28 conditions per place. [2021-03-26 10:14:24,260 INFO L142 LiptonReduction]: Number of co-enabled transitions 120 [2021-03-26 10:14:24,262 INFO L154 LiptonReduction]: Checked pairs total: 174 [2021-03-26 10:14:24,262 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:24,263 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-26 10:14:24,263 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 229 flow [2021-03-26 10:14:24,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,263 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:24,263 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:24,263 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:14:24,264 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:24,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:24,264 INFO L82 PathProgramCache]: Analyzing trace with hash 252741422, now seen corresponding path program 1 times [2021-03-26 10:14:24,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:24,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650968097] [2021-03-26 10:14:24,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:24,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:24,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:24,308 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:14:24,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:14:24,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:24,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:24,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650968097] [2021-03-26 10:14:24,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:24,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:24,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752634861] [2021-03-26 10:14:24,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:24,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:24,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:24,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:24,318 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 145 [2021-03-26 10:14:24,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 229 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:24,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 145 [2021-03-26 10:14:24,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:24,346 INFO L129 PetriNetUnfolder]: 16/67 cut-off events. [2021-03-26 10:14:24,346 INFO L130 PetriNetUnfolder]: For 136/144 co-relation queries the response was YES. [2021-03-26 10:14:24,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 67 events. 16/67 cut-off events. For 136/144 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 250 event pairs, 2 based on Foata normal form. 13/79 useless extension candidates. Maximal degree in co-relation 213. Up to 24 conditions per place. [2021-03-26 10:14:24,347 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 4 selfloop transitions, 6 changer transitions 2/33 dead transitions. [2021-03-26 10:14:24,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 222 flow [2021-03-26 10:14:24,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2021-03-26 10:14:24,349 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8124137931034483 [2021-03-26 10:14:24,349 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2021-03-26 10:14:24,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2021-03-26 10:14:24,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:24,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2021-03-26 10:14:24,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,351 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,351 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 229 flow. Second operand 5 states and 589 transitions. [2021-03-26 10:14:24,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 222 flow [2021-03-26 10:14:24,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 184 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-03-26 10:14:24,353 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 187 flow [2021-03-26 10:14:24,353 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2021-03-26 10:14:24,354 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2021-03-26 10:14:24,354 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:24,354 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 187 flow [2021-03-26 10:14:24,354 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 187 flow [2021-03-26 10:14:24,354 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 187 flow [2021-03-26 10:14:24,360 INFO L129 PetriNetUnfolder]: 11/58 cut-off events. [2021-03-26 10:14:24,360 INFO L130 PetriNetUnfolder]: For 90/96 co-relation queries the response was YES. [2021-03-26 10:14:24,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 58 events. 11/58 cut-off events. For 90/96 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 211 event pairs, 0 based on Foata normal form. 3/61 useless extension candidates. Maximal degree in co-relation 182. Up to 19 conditions per place. [2021-03-26 10:14:24,361 INFO L142 LiptonReduction]: Number of co-enabled transitions 138 [2021-03-26 10:14:24,363 INFO L154 LiptonReduction]: Checked pairs total: 104 [2021-03-26 10:14:24,363 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:24,363 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-26 10:14:24,365 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 187 flow [2021-03-26 10:14:24,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,365 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:24,365 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:24,365 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:14:24,365 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:24,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1778551802, now seen corresponding path program 1 times [2021-03-26 10:14:24,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:24,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123020898] [2021-03-26 10:14:24,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:24,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:24,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:24,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:24,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:24,403 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:14:24,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:14:24,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:24,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:24,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123020898] [2021-03-26 10:14:24,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:24,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:14:24,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746301397] [2021-03-26 10:14:24,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:24,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:24,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:24,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:24,411 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 145 [2021-03-26 10:14:24,412 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,412 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:24,412 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 145 [2021-03-26 10:14:24,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:24,448 INFO L129 PetriNetUnfolder]: 7/47 cut-off events. [2021-03-26 10:14:24,448 INFO L130 PetriNetUnfolder]: For 89/108 co-relation queries the response was YES. [2021-03-26 10:14:24,449 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 47 events. 7/47 cut-off events. For 89/108 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 156 event pairs, 0 based on Foata normal form. 22/69 useless extension candidates. Maximal degree in co-relation 149. Up to 13 conditions per place. [2021-03-26 10:14:24,449 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 2 selfloop transitions, 9 changer transitions 2/34 dead transitions. [2021-03-26 10:14:24,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 225 flow [2021-03-26 10:14:24,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:14:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:14:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 820 transitions. [2021-03-26 10:14:24,451 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8078817733990148 [2021-03-26 10:14:24,451 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 820 transitions. [2021-03-26 10:14:24,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 820 transitions. [2021-03-26 10:14:24,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:24,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 820 transitions. [2021-03-26 10:14:24,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,455 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:24,455 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 187 flow. Second operand 7 states and 820 transitions. [2021-03-26 10:14:24,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 225 flow [2021-03-26 10:14:24,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 34 transitions, 211 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:24,456 INFO L241 Difference]: Finished difference. Result has 49 places, 32 transitions, 209 flow [2021-03-26 10:14:24,456 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2021-03-26 10:14:24,457 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2021-03-26 10:14:24,457 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:24,457 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 32 transitions, 209 flow [2021-03-26 10:14:24,457 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 32 transitions, 209 flow [2021-03-26 10:14:24,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 32 transitions, 209 flow [2021-03-26 10:14:24,462 INFO L129 PetriNetUnfolder]: 6/45 cut-off events. [2021-03-26 10:14:24,462 INFO L130 PetriNetUnfolder]: For 95/99 co-relation queries the response was YES. [2021-03-26 10:14:24,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 45 events. 6/45 cut-off events. For 95/99 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 147 event pairs, 0 based on Foata normal form. 3/48 useless extension candidates. Maximal degree in co-relation 144. Up to 13 conditions per place. [2021-03-26 10:14:24,462 INFO L142 LiptonReduction]: Number of co-enabled transitions 110 [2021-03-26 10:14:24,731 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 10:14:24,865 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 10:14:25,441 WARN L205 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 189 [2021-03-26 10:14:25,642 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-26 10:14:27,434 WARN L205 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 343 DAG size of output: 271 [2021-03-26 10:14:27,947 WARN L205 SmtUtils]: Spent 511.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2021-03-26 10:14:27,951 INFO L154 LiptonReduction]: Checked pairs total: 237 [2021-03-26 10:14:27,952 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:14:27,952 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3495 [2021-03-26 10:14:27,952 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 189 flow [2021-03-26 10:14:27,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:27,952 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:27,952 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:27,952 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:14:27,952 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:27,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:27,953 INFO L82 PathProgramCache]: Analyzing trace with hash 539787335, now seen corresponding path program 1 times [2021-03-26 10:14:27,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:27,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200476726] [2021-03-26 10:14:27,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:27,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:27,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:27,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:27,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:27,993 INFO L142 QuantifierPusher]: treesize reduction 12, result has 60.0 percent of original size [2021-03-26 10:14:27,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:14:28,002 INFO L142 QuantifierPusher]: treesize reduction 12, result has 60.0 percent of original size [2021-03-26 10:14:28,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:14:28,012 INFO L142 QuantifierPusher]: treesize reduction 2, result has 95.7 percent of original size [2021-03-26 10:14:28,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 10:14:28,026 INFO L142 QuantifierPusher]: treesize reduction 14, result has 22.2 percent of original size [2021-03-26 10:14:28,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:14:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:28,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200476726] [2021-03-26 10:14:28,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:28,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:14:28,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531420018] [2021-03-26 10:14:28,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:14:28,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:28,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:14:28,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:14:28,032 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 147 [2021-03-26 10:14:28,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 28 transitions, 189 flow. Second operand has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:28,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:28,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 147 [2021-03-26 10:14:28,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:28,092 INFO L129 PetriNetUnfolder]: 16/61 cut-off events. [2021-03-26 10:14:28,093 INFO L130 PetriNetUnfolder]: For 209/217 co-relation queries the response was YES. [2021-03-26 10:14:28,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 61 events. 16/61 cut-off events. For 209/217 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 203 event pairs, 0 based on Foata normal form. 9/70 useless extension candidates. Maximal degree in co-relation 223. Up to 19 conditions per place. [2021-03-26 10:14:28,093 INFO L132 encePairwiseOnDemand]: 140/147 looper letters, 9 selfloop transitions, 2 changer transitions 20/40 dead transitions. [2021-03-26 10:14:28,093 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 313 flow [2021-03-26 10:14:28,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:14:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:14:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 704 transitions. [2021-03-26 10:14:28,095 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6841593780369291 [2021-03-26 10:14:28,095 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 704 transitions. [2021-03-26 10:14:28,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 704 transitions. [2021-03-26 10:14:28,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:28,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 704 transitions. [2021-03-26 10:14:28,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.57142857142857) internal successors, (704), 7 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:28,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 147.0) internal successors, (1176), 8 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:28,098 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 147.0) internal successors, (1176), 8 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:28,098 INFO L185 Difference]: Start difference. First operand has 46 places, 28 transitions, 189 flow. Second operand 7 states and 704 transitions. [2021-03-26 10:14:28,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 313 flow [2021-03-26 10:14:28,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 292 flow, removed 6 selfloop flow, removed 7 redundant places. [2021-03-26 10:14:28,100 INFO L241 Difference]: Finished difference. Result has 45 places, 19 transitions, 122 flow [2021-03-26 10:14:28,100 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=122, PETRI_PLACES=45, PETRI_TRANSITIONS=19} [2021-03-26 10:14:28,100 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2021-03-26 10:14:28,100 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:28,101 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 19 transitions, 122 flow [2021-03-26 10:14:28,101 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 19 transitions, 122 flow [2021-03-26 10:14:28,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 19 transitions, 122 flow [2021-03-26 10:14:28,103 INFO L129 PetriNetUnfolder]: 3/27 cut-off events. [2021-03-26 10:14:28,104 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2021-03-26 10:14:28,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 27 events. 3/27 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 87. Up to 7 conditions per place. [2021-03-26 10:14:28,104 INFO L142 LiptonReduction]: Number of co-enabled transitions 16 [2021-03-26 10:14:28,248 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:14:28,580 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 10:14:28,693 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:14:28,973 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 83 [2021-03-26 10:14:29,091 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-26 10:14:29,092 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:14:29,092 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 992 [2021-03-26 10:14:29,092 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 17 transitions, 125 flow [2021-03-26 10:14:29,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:29,092 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:29,093 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:29,093 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:14:29,093 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:29,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1224533860, now seen corresponding path program 1 times [2021-03-26 10:14:29,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:29,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798868723] [2021-03-26 10:14:29,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:14:29,108 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:14:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:14:29,123 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:14:29,139 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:14:29,139 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:14:29,139 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:14:29,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:14:29 BasicIcfg [2021-03-26 10:14:29,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:14:29,170 INFO L168 Benchmark]: Toolchain (without parser) took 18864.88 ms. Allocated memory was 255.9 MB in the beginning and 633.3 MB in the end (delta: 377.5 MB). Free memory was 234.9 MB in the beginning and 246.1 MB in the end (delta: -11.1 MB). Peak memory consumption was 364.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:29,170 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 174.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:14:29,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.90 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 234.3 MB in the beginning and 319.6 MB in the end (delta: -85.3 MB). Peak memory consumption was 17.4 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:29,170 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.09 ms. Allocated memory is still 358.6 MB. Free memory was 319.6 MB in the beginning and 316.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:29,171 INFO L168 Benchmark]: Boogie Preprocessor took 20.63 ms. Allocated memory is still 358.6 MB. Free memory was 316.7 MB in the beginning and 314.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:29,171 INFO L168 Benchmark]: RCFGBuilder took 1136.36 ms. Allocated memory is still 358.6 MB. Free memory was 314.7 MB in the beginning and 245.0 MB in the end (delta: 69.7 MB). Peak memory consumption was 71.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:29,171 INFO L168 Benchmark]: TraceAbstraction took 17269.94 ms. Allocated memory was 358.6 MB in the beginning and 633.3 MB in the end (delta: 274.7 MB). Free memory was 245.0 MB in the beginning and 246.1 MB in the end (delta: -1.0 MB). Peak memory consumption was 273.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:29,172 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.11 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 174.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 380.90 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 234.3 MB in the beginning and 319.6 MB in the end (delta: -85.3 MB). Peak memory consumption was 17.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 53.09 ms. Allocated memory is still 358.6 MB. Free memory was 319.6 MB in the beginning and 316.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 20.63 ms. Allocated memory is still 358.6 MB. Free memory was 316.7 MB in the beginning and 314.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1136.36 ms. Allocated memory is still 358.6 MB. Free memory was 314.7 MB in the beginning and 245.0 MB in the end (delta: 69.7 MB). Peak memory consumption was 71.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17269.94 ms. Allocated memory was 358.6 MB in the beginning and 633.3 MB in the end (delta: 274.7 MB). Free memory was 245.0 MB in the beginning and 246.1 MB in the end (delta: -1.0 MB). Peak memory consumption was 273.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6662.1ms, 83 PlacesBefore, 36 PlacesAfterwards, 78 TransitionsBefore, 30 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 56 TotalNumberOfCompositions, 1544 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 817, positive: 762, positive conditional: 762, positive unconditional: 0, negative: 55, negative conditional: 55, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 817, positive: 762, positive conditional: 0, positive unconditional: 762, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 817, positive: 762, positive conditional: 0, positive unconditional: 762, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 598, positive: 570, positive conditional: 0, positive unconditional: 570, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 598, positive: 567, positive conditional: 0, positive unconditional: 567, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 373, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 365, negative conditional: 0, negative unconditional: 365, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 817, positive: 192, positive conditional: 0, positive unconditional: 192, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 598, unknown conditional: 0, unknown unconditional: 598] , Statistics on independence cache: Total cache size (in pairs): 598, Positive cache size: 570, Positive conditional cache size: 0, Positive unconditional cache size: 570, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2798.7ms, 34 PlacesBefore, 23 PlacesAfterwards, 23 TransitionsBefore, 16 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 4 FixpointIterations, 5 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 536 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 256, positive: 194, positive conditional: 194, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 256, positive: 194, positive conditional: 24, positive unconditional: 170, negative: 62, negative conditional: 20, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 256, positive: 194, positive conditional: 24, positive unconditional: 170, negative: 62, negative conditional: 20, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 64, positive: 45, positive conditional: 2, positive unconditional: 43, negative: 19, negative conditional: 7, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 64, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 19, negative conditional: 7, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 338, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 334, negative conditional: 132, negative unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 256, positive: 149, positive conditional: 22, positive unconditional: 127, negative: 43, negative conditional: 13, negative unconditional: 30, unknown: 64, unknown conditional: 9, unknown unconditional: 55] , Statistics on independence cache: Total cache size (in pairs): 662, Positive cache size: 615, Positive conditional cache size: 2, Positive unconditional cache size: 613, Negative cache size: 47, Negative conditional cache size: 7, Negative unconditional cache size: 40, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 660.9ms, 26 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 236 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 105, positive: 79, positive conditional: 8, positive unconditional: 71, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 105, positive: 79, positive conditional: 8, positive unconditional: 71, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 105, positive: 77, positive conditional: 8, positive unconditional: 69, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 664, Positive cache size: 617, Positive conditional cache size: 2, Positive unconditional cache size: 615, Negative cache size: 47, Negative conditional cache size: 7, Negative unconditional cache size: 40, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.0ms, 29 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 74 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 37, positive: 28, positive conditional: 3, positive unconditional: 25, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 28, positive conditional: 3, positive unconditional: 25, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, positive: 28, positive conditional: 3, positive unconditional: 25, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 664, Positive cache size: 617, Positive conditional cache size: 2, Positive unconditional cache size: 615, Negative cache size: 47, Negative conditional cache size: 7, Negative unconditional cache size: 40, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 672.0ms, 32 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 159 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, positive: 62, positive conditional: 62, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 81, positive: 62, positive conditional: 10, positive unconditional: 52, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 81, positive: 62, positive conditional: 10, positive unconditional: 52, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, positive: 61, positive conditional: 10, positive unconditional: 51, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 667, Positive cache size: 618, Positive conditional cache size: 2, Positive unconditional cache size: 616, Negative cache size: 49, Negative conditional cache size: 7, Negative unconditional cache size: 42, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.2ms, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 100 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, positive: 50, positive conditional: 9, positive unconditional: 41, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 50, positive conditional: 9, positive unconditional: 41, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, positive: 50, positive conditional: 9, positive unconditional: 41, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 667, Positive cache size: 618, Positive conditional cache size: 2, Positive unconditional cache size: 616, Negative cache size: 49, Negative conditional cache size: 7, Negative unconditional cache size: 42, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.8ms, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 108 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, positive: 47, positive conditional: 47, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, positive: 47, positive conditional: 8, positive unconditional: 39, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 47, positive conditional: 8, positive unconditional: 39, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, positive: 47, positive conditional: 8, positive unconditional: 39, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 667, Positive cache size: 618, Positive conditional cache size: 2, Positive unconditional cache size: 616, Negative cache size: 49, Negative conditional cache size: 7, Negative unconditional cache size: 42, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.8ms, 38 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 139 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, positive: 57, positive conditional: 11, positive unconditional: 46, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 57, positive conditional: 11, positive unconditional: 46, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 57, positive conditional: 11, positive unconditional: 46, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 667, Positive cache size: 618, Positive conditional cache size: 2, Positive unconditional cache size: 616, Negative cache size: 49, Negative conditional cache size: 7, Negative unconditional cache size: 42, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.4ms, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 174 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 115, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 115, positive: 97, positive conditional: 19, positive unconditional: 78, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 115, positive: 97, positive conditional: 19, positive unconditional: 78, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 115, positive: 97, positive conditional: 19, positive unconditional: 78, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 667, Positive cache size: 618, Positive conditional cache size: 2, Positive unconditional cache size: 616, Negative cache size: 49, Negative conditional cache size: 7, Negative unconditional cache size: 42, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4ms, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 104 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, positive: 56, positive conditional: 56, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, positive: 56, positive conditional: 24, positive unconditional: 32, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 56, positive conditional: 24, positive unconditional: 32, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, positive: 54, positive conditional: 24, positive unconditional: 30, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 620, Positive conditional cache size: 2, Positive unconditional cache size: 618, Negative cache size: 49, Negative conditional cache size: 7, Negative unconditional cache size: 42, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3494.6ms, 49 PlacesBefore, 46 PlacesAfterwards, 32 TransitionsBefore, 28 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 237 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 181, positive: 151, positive conditional: 151, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 181, positive: 151, positive conditional: 117, positive unconditional: 34, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 181, positive: 151, positive conditional: 117, positive unconditional: 34, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 11, 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: 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: 181, positive: 140, positive conditional: 106, positive unconditional: 34, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 680, Positive cache size: 631, Positive conditional cache size: 13, Positive unconditional cache size: 618, Negative cache size: 49, Negative conditional cache size: 7, Negative unconditional cache size: 42, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 990.9ms, 45 PlacesBefore, 36 PlacesAfterwards, 19 TransitionsBefore, 17 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 4 FixpointIterations, 3 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 680, Positive cache size: 631, Positive conditional cache size: 13, Positive unconditional cache size: 618, Negative cache size: 49, Negative conditional cache size: 7, Negative unconditional cache size: 42, Eliminated conditions: 9 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1451; [L793] FCALL, FORK 0 pthread_create(&t1451, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1452; [L795] FCALL, FORK 0 pthread_create(&t1452, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17166.8ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 644.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6710.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 46 SDtfs, 31 SDslu, 18 SDs, 0 SdLazy, 260 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 244.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 229.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=8, InterpolantAutomatonStates: 51, 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: 32.6ms SsaConstructionTime, 284.1ms SatisfiabilityAnalysisTime, 615.7ms InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 854 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...