/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:32:29,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:32:29,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:32:29,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:32:29,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:32:29,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:32:29,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:32:29,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:32:29,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:32:29,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:32:29,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:32:29,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:32:29,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:32:29,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:32:29,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:32:29,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:32:29,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:32:29,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:32:29,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:32:29,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:32:29,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:32:29,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:32:29,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:32:29,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:32:29,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:32:29,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:32:29,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:32:29,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:32:29,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:32:29,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:32:29,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:32:29,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:32:29,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:32:29,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:32:29,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:32:29,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:32:29,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:32:29,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:32:29,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:32:29,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:32:29,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:32:29,413 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-RepeatedSemanticLbe.epf [2021-03-25 14:32:29,426 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:32:29,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:32:29,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:32:29,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:32:29,427 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:32:29,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:32:29,428 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:32:29,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:32:29,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:32:29,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:32:29,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:32:29,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:32:29,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:32:29,428 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:32:29,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:32:29,428 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:32:29,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:32:29,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:32:29,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:32:29,429 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:32:29,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:32:29,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:32:29,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:32:29,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:32:29,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:32:29,429 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:32:29,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:32:29,430 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:32:29,430 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:32:29,430 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-25 14:32:29,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:32:29,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:32:29,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:32:29,648 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:32:29,649 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:32:29,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2021-03-25 14:32:29,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d0048855/5e068060086a451b9d5e7370999bafcd/FLAGea8b3db6b [2021-03-25 14:32:30,135 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:32:30,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2021-03-25 14:32:30,147 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d0048855/5e068060086a451b9d5e7370999bafcd/FLAGea8b3db6b [2021-03-25 14:32:30,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d0048855/5e068060086a451b9d5e7370999bafcd [2021-03-25 14:32:30,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:32:30,482 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:32:30,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:32:30,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:32:30,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:32:30,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:32:30" (1/1) ... [2021-03-25 14:32:30,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c958cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:30, skipping insertion in model container [2021-03-25 14:32:30,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:32:30" (1/1) ... [2021-03-25 14:32:30,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:32:30,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:32:30,607 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/mix042_pso.opt.i[948,961] [2021-03-25 14:32:30,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:32:30,771 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:32:30,781 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/mix042_pso.opt.i[948,961] [2021-03-25 14:32:30,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:32:30,858 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:32:30,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:30 WrapperNode [2021-03-25 14:32:30,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:32:30,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:32:30,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:32:30,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:32:30,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:30" (1/1) ... [2021-03-25 14:32:30,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:30" (1/1) ... [2021-03-25 14:32:30,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:32:30,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:32:30,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:32:30,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:32:30,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:30" (1/1) ... [2021-03-25 14:32:30,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:30" (1/1) ... [2021-03-25 14:32:30,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:30" (1/1) ... [2021-03-25 14:32:30,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:30" (1/1) ... [2021-03-25 14:32:30,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:30" (1/1) ... [2021-03-25 14:32:30,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:30" (1/1) ... [2021-03-25 14:32:30,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:30" (1/1) ... [2021-03-25 14:32:30,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:32:30,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:32:30,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:32:30,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:32:30,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:30" (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-25 14:32:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:32:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:32:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:32:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:32:30,955 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:32:30,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:32:30,955 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:32:30,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:32:30,955 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:32:30,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:32:30,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:32:30,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:32:30,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:32:30,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:32:30,956 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:32:32,499 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:32:32,499 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:32:32,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:32:32 BoogieIcfgContainer [2021-03-25 14:32:32,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:32:32,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:32:32,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:32:32,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:32:32,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:32:30" (1/3) ... [2021-03-25 14:32:32,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74febc62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:32:32, skipping insertion in model container [2021-03-25 14:32:32,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:30" (2/3) ... [2021-03-25 14:32:32,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74febc62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:32:32, skipping insertion in model container [2021-03-25 14:32:32,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:32:32" (3/3) ... [2021-03-25 14:32:32,505 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_pso.opt.i [2021-03-25 14:32:32,509 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:32:32,512 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:32:32,512 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:32:32,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,531 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,531 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,531 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,531 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,532 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,532 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,532 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,533 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,535 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,535 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,535 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,535 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,535 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,536 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,536 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,536 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,539 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,540 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,540 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,542 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,542 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,543 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:32,544 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:32:32,555 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:32:32,567 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:32:32,567 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:32:32,567 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:32:32,567 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:32:32,567 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:32:32,567 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:32:32,567 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:32:32,567 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:32:32,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2021-03-25 14:32:32,596 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-25 14:32:32,596 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:32,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-25 14:32:32,599 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 101 transitions, 217 flow [2021-03-25 14:32:32,601 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 98 transitions, 205 flow [2021-03-25 14:32:32,602 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:32,610 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-25 14:32:32,611 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-25 14:32:32,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 205 flow [2021-03-25 14:32:32,624 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-25 14:32:32,624 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:32,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-25 14:32:32,626 INFO L142 LiptonReduction]: Number of co-enabled transitions 1738 [2021-03-25 14:32:33,606 WARN L205 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-25 14:32:33,868 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 14:32:35,158 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 14:32:35,737 WARN L205 SmtUtils]: Spent 576.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:32:36,497 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:32:36,869 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 14:32:36,983 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:32:38,224 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:32:38,517 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:32:39,137 WARN L205 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:32:39,722 WARN L205 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:32:39,802 INFO L154 LiptonReduction]: Checked pairs total: 2986 [2021-03-25 14:32:39,802 INFO L156 LiptonReduction]: Total number of compositions: 67 [2021-03-25 14:32:39,804 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7202 [2021-03-25 14:32:39,810 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-25 14:32:39,810 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:39,810 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:39,810 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:39,810 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:39,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:39,814 INFO L82 PathProgramCache]: Analyzing trace with hash 684331068, now seen corresponding path program 1 times [2021-03-25 14:32:39,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:39,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000815872] [2021-03-25 14:32:39,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:39,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:39,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:39,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:39,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:39,976 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-25 14:32:39,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000815872] [2021-03-25 14:32:39,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:39,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:32:39,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882819968] [2021-03-25 14:32:39,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:32:39,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:39,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:32:39,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:32:39,992 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 168 [2021-03-25 14:32:39,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:39,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:39,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 168 [2021-03-25 14:32:39,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:40,063 INFO L129 PetriNetUnfolder]: 23/100 cut-off events. [2021-03-25 14:32:40,063 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:40,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 100 events. 23/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 325 event pairs, 9 based on Foata normal form. 5/98 useless extension candidates. Maximal degree in co-relation 139. Up to 37 conditions per place. [2021-03-25 14:32:40,065 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 7 selfloop transitions, 2 changer transitions 5/40 dead transitions. [2021-03-25 14:32:40,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 111 flow [2021-03-25 14:32:40,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:32:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:32:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2021-03-25 14:32:40,076 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2021-03-25 14:32:40,076 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2021-03-25 14:32:40,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2021-03-25 14:32:40,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:40,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2021-03-25 14:32:40,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:40,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:40,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:40,086 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 455 transitions. [2021-03-25 14:32:40,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 111 flow [2021-03-25 14:32:40,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:32:40,089 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 74 flow [2021-03-25 14:32:40,090 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-25 14:32:40,091 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-25 14:32:40,091 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:40,091 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-25 14:32:40,091 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-25 14:32:40,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2021-03-25 14:32:40,094 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-25 14:32:40,094 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:40,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:32:40,094 INFO L142 LiptonReduction]: Number of co-enabled transitions 254 [2021-03-25 14:32:40,405 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 14:32:40,538 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 14:32:41,317 WARN L205 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 188 [2021-03-25 14:32:41,572 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:32:42,123 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:32:42,689 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:32:43,351 INFO L154 LiptonReduction]: Checked pairs total: 976 [2021-03-25 14:32:43,352 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-25 14:32:43,352 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3261 [2021-03-25 14:32:43,352 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2021-03-25 14:32:43,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:43,353 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:43,353 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:43,353 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:32:43,353 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:43,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1683336467, now seen corresponding path program 1 times [2021-03-25 14:32:43,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:43,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023399440] [2021-03-25 14:32:43,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:43,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:43,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:43,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:43,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:43,434 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:32:43,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:32:43,437 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-25 14:32:43,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023399440] [2021-03-25 14:32:43,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:43,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:32:43,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745891315] [2021-03-25 14:32:43,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:32:43,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:43,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:32:43,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:32:43,439 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 178 [2021-03-25 14:32:43,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:43,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:43,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 178 [2021-03-25 14:32:43,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:43,450 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 14:32:43,450 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:32:43,450 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 22 events. 0/22 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:32:43,450 INFO L132 encePairwiseOnDemand]: 175/178 looper letters, 1 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2021-03-25 14:32:43,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 22 transitions, 60 flow [2021-03-25 14:32:43,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:32:43,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:32:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2021-03-25 14:32:43,452 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8726591760299626 [2021-03-25 14:32:43,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2021-03-25 14:32:43,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2021-03-25 14:32:43,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:43,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2021-03-25 14:32:43,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:43,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:43,455 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:43,456 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 466 transitions. [2021-03-25 14:32:43,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 22 transitions, 60 flow [2021-03-25 14:32:43,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 22 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:32:43,456 INFO L241 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2021-03-25 14:32:43,456 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2021-03-25 14:32:43,457 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -16 predicate places. [2021-03-25 14:32:43,457 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:43,457 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 58 flow [2021-03-25 14:32:43,457 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 58 flow [2021-03-25 14:32:43,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 58 flow [2021-03-25 14:32:43,460 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 14:32:43,460 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:32:43,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 0/22 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:32:43,460 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-25 14:32:43,602 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:32:44,083 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-25 14:32:44,231 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 14:32:44,514 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-25 14:32:44,651 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 14:32:44,654 INFO L154 LiptonReduction]: Checked pairs total: 645 [2021-03-25 14:32:44,654 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:32:44,654 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1197 [2021-03-25 14:32:44,655 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2021-03-25 14:32:44,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:44,655 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:44,655 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:44,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:32:44,655 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:44,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:44,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1317855793, now seen corresponding path program 1 times [2021-03-25 14:32:44,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:44,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809274819] [2021-03-25 14:32:44,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:44,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:44,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:44,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:44,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:32:44,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:44,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:32:44,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:44,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:32:44,768 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-25 14:32:44,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809274819] [2021-03-25 14:32:44,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:44,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:32:44,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027722354] [2021-03-25 14:32:44,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:32:44,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:44,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:32:44,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:32:44,770 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 180 [2021-03-25 14:32:44,771 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:44,771 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:44,771 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 180 [2021-03-25 14:32:44,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:44,826 INFO L129 PetriNetUnfolder]: 27/78 cut-off events. [2021-03-25 14:32:44,826 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-03-25 14:32:44,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 78 events. 27/78 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 265 event pairs, 14 based on Foata normal form. 2/79 useless extension candidates. Maximal degree in co-relation 151. Up to 49 conditions per place. [2021-03-25 14:32:44,827 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 8 selfloop transitions, 8 changer transitions 0/29 dead transitions. [2021-03-25 14:32:44,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 107 flow [2021-03-25 14:32:44,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:32:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:32:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2021-03-25 14:32:44,829 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7533333333333333 [2021-03-25 14:32:44,829 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2021-03-25 14:32:44,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2021-03-25 14:32:44,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:44,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2021-03-25 14:32:44,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:44,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:44,832 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:44,832 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 5 states and 678 transitions. [2021-03-25 14:32:44,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 107 flow [2021-03-25 14:32:44,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 101 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:32:44,833 INFO L241 Difference]: Finished difference. Result has 35 places, 27 transitions, 105 flow [2021-03-25 14:32:44,833 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2021-03-25 14:32:44,834 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -13 predicate places. [2021-03-25 14:32:44,834 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:44,834 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 105 flow [2021-03-25 14:32:44,834 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 105 flow [2021-03-25 14:32:44,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 105 flow [2021-03-25 14:32:44,865 INFO L129 PetriNetUnfolder]: 12/56 cut-off events. [2021-03-25 14:32:44,865 INFO L130 PetriNetUnfolder]: For 27/28 co-relation queries the response was YES. [2021-03-25 14:32:44,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 56 events. 12/56 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 166 event pairs, 2 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 119. Up to 19 conditions per place. [2021-03-25 14:32:44,867 INFO L142 LiptonReduction]: Number of co-enabled transitions 250 [2021-03-25 14:32:44,869 INFO L154 LiptonReduction]: Checked pairs total: 266 [2021-03-25 14:32:44,869 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:32:44,869 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-25 14:32:44,871 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 105 flow [2021-03-25 14:32:44,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:44,871 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:44,872 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:44,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:32:44,872 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:44,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:44,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1594965058, now seen corresponding path program 1 times [2021-03-25 14:32:44,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:44,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282843747] [2021-03-25 14:32:44,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:44,966 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-25 14:32:44,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 14:32:44,997 INFO L142 QuantifierPusher]: treesize reduction 14, result has 44.0 percent of original size [2021-03-25 14:32:45,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:32:45,007 INFO L142 QuantifierPusher]: treesize reduction 14, result has 44.0 percent of original size [2021-03-25 14:32:45,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:32:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:32:45,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282843747] [2021-03-25 14:32:45,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:45,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:32:45,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452447597] [2021-03-25 14:32:45,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:32:45,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:45,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:32:45,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:32:45,019 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 180 [2021-03-25 14:32:45,020 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:45,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 180 [2021-03-25 14:32:45,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:45,086 INFO L129 PetriNetUnfolder]: 24/75 cut-off events. [2021-03-25 14:32:45,087 INFO L130 PetriNetUnfolder]: For 66/76 co-relation queries the response was YES. [2021-03-25 14:32:45,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 75 events. 24/75 cut-off events. For 66/76 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 241 event pairs, 2 based on Foata normal form. 8/82 useless extension candidates. Maximal degree in co-relation 202. Up to 31 conditions per place. [2021-03-25 14:32:45,089 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 11 selfloop transitions, 11 changer transitions 0/35 dead transitions. [2021-03-25 14:32:45,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 182 flow [2021-03-25 14:32:45,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:32:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:32:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2021-03-25 14:32:45,091 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7688888888888888 [2021-03-25 14:32:45,091 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2021-03-25 14:32:45,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2021-03-25 14:32:45,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:45,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2021-03-25 14:32:45,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,095 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,095 INFO L185 Difference]: Start difference. First operand has 35 places, 27 transitions, 105 flow. Second operand 5 states and 692 transitions. [2021-03-25 14:32:45,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 182 flow [2021-03-25 14:32:45,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:32:45,097 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 165 flow [2021-03-25 14:32:45,097 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2021-03-25 14:32:45,097 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2021-03-25 14:32:45,098 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:45,098 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 165 flow [2021-03-25 14:32:45,098 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 165 flow [2021-03-25 14:32:45,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 165 flow [2021-03-25 14:32:45,107 INFO L129 PetriNetUnfolder]: 17/66 cut-off events. [2021-03-25 14:32:45,108 INFO L130 PetriNetUnfolder]: For 70/71 co-relation queries the response was YES. [2021-03-25 14:32:45,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 66 events. 17/66 cut-off events. For 70/71 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 223 event pairs, 3 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 186. Up to 25 conditions per place. [2021-03-25 14:32:45,109 INFO L142 LiptonReduction]: Number of co-enabled transitions 276 [2021-03-25 14:32:45,113 INFO L154 LiptonReduction]: Checked pairs total: 276 [2021-03-25 14:32:45,113 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:32:45,113 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-25 14:32:45,117 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 165 flow [2021-03-25 14:32:45,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,117 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:45,117 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:45,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:32:45,118 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:45,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:45,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1018210983, now seen corresponding path program 1 times [2021-03-25 14:32:45,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:45,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440185577] [2021-03-25 14:32:45,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:45,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:45,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:45,195 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:32:45,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:32:45,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:45,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:45,202 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-25 14:32:45,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440185577] [2021-03-25 14:32:45,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:45,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:32:45,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825656143] [2021-03-25 14:32:45,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:32:45,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:45,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:32:45,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:32:45,204 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 180 [2021-03-25 14:32:45,204 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,205 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:45,205 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 180 [2021-03-25 14:32:45,205 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:45,251 INFO L129 PetriNetUnfolder]: 70/177 cut-off events. [2021-03-25 14:32:45,251 INFO L130 PetriNetUnfolder]: For 172/185 co-relation queries the response was YES. [2021-03-25 14:32:45,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 177 events. 70/177 cut-off events. For 172/185 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 873 event pairs, 29 based on Foata normal form. 23/188 useless extension candidates. Maximal degree in co-relation 475. Up to 87 conditions per place. [2021-03-25 14:32:45,252 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 9 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2021-03-25 14:32:45,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 219 flow [2021-03-25 14:32:45,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:32:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:32:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 783 transitions. [2021-03-25 14:32:45,255 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.87 [2021-03-25 14:32:45,255 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 783 transitions. [2021-03-25 14:32:45,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 783 transitions. [2021-03-25 14:32:45,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:45,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 783 transitions. [2021-03-25 14:32:45,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 156.6) internal successors, (783), 5 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,258 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,258 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 165 flow. Second operand 5 states and 783 transitions. [2021-03-25 14:32:45,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 219 flow [2021-03-25 14:32:45,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 204 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-25 14:32:45,261 INFO L241 Difference]: Finished difference. Result has 46 places, 38 transitions, 214 flow [2021-03-25 14:32:45,261 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2021-03-25 14:32:45,261 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2021-03-25 14:32:45,261 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:45,261 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 38 transitions, 214 flow [2021-03-25 14:32:45,261 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 38 transitions, 214 flow [2021-03-25 14:32:45,262 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 38 transitions, 214 flow [2021-03-25 14:32:45,278 INFO L129 PetriNetUnfolder]: 76/183 cut-off events. [2021-03-25 14:32:45,279 INFO L130 PetriNetUnfolder]: For 183/196 co-relation queries the response was YES. [2021-03-25 14:32:45,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 183 events. 76/183 cut-off events. For 183/196 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 895 event pairs, 29 based on Foata normal form. 3/170 useless extension candidates. Maximal degree in co-relation 535. Up to 94 conditions per place. [2021-03-25 14:32:45,281 INFO L142 LiptonReduction]: Number of co-enabled transitions 366 [2021-03-25 14:32:45,322 INFO L154 LiptonReduction]: Checked pairs total: 259 [2021-03-25 14:32:45,322 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:32:45,322 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 61 [2021-03-25 14:32:45,322 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 214 flow [2021-03-25 14:32:45,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,323 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:45,323 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:45,323 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:32:45,323 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:45,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:45,323 INFO L82 PathProgramCache]: Analyzing trace with hash -487523961, now seen corresponding path program 1 times [2021-03-25 14:32:45,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:45,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814646153] [2021-03-25 14:32:45,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:45,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:45,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:45,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:45,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:45,394 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:32:45,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:32:45,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:45,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:45,401 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-25 14:32:45,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814646153] [2021-03-25 14:32:45,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:45,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:32:45,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135250931] [2021-03-25 14:32:45,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:32:45,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:45,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:32:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:32:45,402 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 180 [2021-03-25 14:32:45,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:45,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 180 [2021-03-25 14:32:45,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:45,460 INFO L129 PetriNetUnfolder]: 38/123 cut-off events. [2021-03-25 14:32:45,460 INFO L130 PetriNetUnfolder]: For 251/416 co-relation queries the response was YES. [2021-03-25 14:32:45,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 123 events. 38/123 cut-off events. For 251/416 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 568 event pairs, 5 based on Foata normal form. 61/177 useless extension candidates. Maximal degree in co-relation 431. Up to 72 conditions per place. [2021-03-25 14:32:45,461 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 5 selfloop transitions, 15 changer transitions 3/45 dead transitions. [2021-03-25 14:32:45,461 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 293 flow [2021-03-25 14:32:45,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:32:45,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:32:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1096 transitions. [2021-03-25 14:32:45,463 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8698412698412699 [2021-03-25 14:32:45,463 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1096 transitions. [2021-03-25 14:32:45,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1096 transitions. [2021-03-25 14:32:45,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:45,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1096 transitions. [2021-03-25 14:32:45,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.57142857142858) internal successors, (1096), 7 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,467 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,467 INFO L185 Difference]: Start difference. First operand has 46 places, 38 transitions, 214 flow. Second operand 7 states and 1096 transitions. [2021-03-25 14:32:45,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 293 flow [2021-03-25 14:32:45,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 281 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-25 14:32:45,470 INFO L241 Difference]: Finished difference. Result has 52 places, 42 transitions, 276 flow [2021-03-25 14:32:45,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2021-03-25 14:32:45,471 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2021-03-25 14:32:45,471 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:45,471 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 42 transitions, 276 flow [2021-03-25 14:32:45,471 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 42 transitions, 276 flow [2021-03-25 14:32:45,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 276 flow [2021-03-25 14:32:45,485 INFO L129 PetriNetUnfolder]: 36/120 cut-off events. [2021-03-25 14:32:45,485 INFO L130 PetriNetUnfolder]: For 299/343 co-relation queries the response was YES. [2021-03-25 14:32:45,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 120 events. 36/120 cut-off events. For 299/343 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 566 event pairs, 4 based on Foata normal form. 4/116 useless extension candidates. Maximal degree in co-relation 459. Up to 68 conditions per place. [2021-03-25 14:32:45,486 INFO L142 LiptonReduction]: Number of co-enabled transitions 402 [2021-03-25 14:32:45,647 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 14:32:46,000 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 14:32:46,106 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 14:32:46,111 INFO L154 LiptonReduction]: Checked pairs total: 474 [2021-03-25 14:32:46,111 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:32:46,112 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 641 [2021-03-25 14:32:46,112 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 261 flow [2021-03-25 14:32:46,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:46,112 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:46,112 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:46,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:32:46,113 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:46,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:46,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1029889496, now seen corresponding path program 1 times [2021-03-25 14:32:46,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:46,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498561279] [2021-03-25 14:32:46,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:46,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:46,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:46,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:46,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:46,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:46,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:46,188 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:32:46,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:32:46,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:46,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:46,195 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-25 14:32:46,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498561279] [2021-03-25 14:32:46,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:46,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:32:46,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042058544] [2021-03-25 14:32:46,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:32:46,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:46,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:32:46,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:32:46,197 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 181 [2021-03-25 14:32:46,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:46,197 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:46,197 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 181 [2021-03-25 14:32:46,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:46,237 INFO L129 PetriNetUnfolder]: 15/60 cut-off events. [2021-03-25 14:32:46,237 INFO L130 PetriNetUnfolder]: For 188/206 co-relation queries the response was YES. [2021-03-25 14:32:46,238 INFO L84 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 60 events. 15/60 cut-off events. For 188/206 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 157 event pairs, 0 based on Foata normal form. 19/78 useless extension candidates. Maximal degree in co-relation 226. Up to 32 conditions per place. [2021-03-25 14:32:46,238 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 2 selfloop transitions, 11 changer transitions 3/38 dead transitions. [2021-03-25 14:32:46,238 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 38 transitions, 266 flow [2021-03-25 14:32:46,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:32:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:32:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1096 transitions. [2021-03-25 14:32:46,240 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8650355169692187 [2021-03-25 14:32:46,240 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1096 transitions. [2021-03-25 14:32:46,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1096 transitions. [2021-03-25 14:32:46,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:46,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1096 transitions. [2021-03-25 14:32:46,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.57142857142858) internal successors, (1096), 7 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:46,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:46,244 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:46,244 INFO L185 Difference]: Start difference. First operand has 52 places, 40 transitions, 261 flow. Second operand 7 states and 1096 transitions. [2021-03-25 14:32:46,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 38 transitions, 266 flow [2021-03-25 14:32:46,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 233 flow, removed 13 selfloop flow, removed 5 redundant places. [2021-03-25 14:32:46,247 INFO L241 Difference]: Finished difference. Result has 51 places, 35 transitions, 213 flow [2021-03-25 14:32:46,247 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2021-03-25 14:32:46,247 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2021-03-25 14:32:46,247 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:46,247 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 35 transitions, 213 flow [2021-03-25 14:32:46,247 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 35 transitions, 213 flow [2021-03-25 14:32:46,247 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 35 transitions, 213 flow [2021-03-25 14:32:46,252 INFO L129 PetriNetUnfolder]: 12/53 cut-off events. [2021-03-25 14:32:46,252 INFO L130 PetriNetUnfolder]: For 79/82 co-relation queries the response was YES. [2021-03-25 14:32:46,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 53 events. 12/53 cut-off events. For 79/82 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 148 event pairs, 0 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 170. Up to 17 conditions per place. [2021-03-25 14:32:46,252 INFO L142 LiptonReduction]: Number of co-enabled transitions 220 [2021-03-25 14:32:46,813 WARN L205 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-25 14:32:47,042 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-25 14:32:48,236 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 339 DAG size of output: 262 [2021-03-25 14:32:48,722 WARN L205 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-25 14:32:48,941 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 14:32:49,160 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 14:32:49,626 WARN L205 SmtUtils]: Spent 464.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 14:32:50,097 WARN L205 SmtUtils]: Spent 469.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 14:32:50,101 INFO L154 LiptonReduction]: Checked pairs total: 511 [2021-03-25 14:32:50,102 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:32:50,102 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3855 [2021-03-25 14:32:50,102 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 199 flow [2021-03-25 14:32:50,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:50,103 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:50,103 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:50,103 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:32:50,103 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1190843652, now seen corresponding path program 1 times [2021-03-25 14:32:50,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:50,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567287566] [2021-03-25 14:32:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:50,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:50,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:50,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:50,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:32:50,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:50,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:32:50,181 INFO L142 QuantifierPusher]: treesize reduction 14, result has 36.4 percent of original size [2021-03-25 14:32:50,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 14:32:50,188 INFO L142 QuantifierPusher]: treesize reduction 14, result has 36.4 percent of original size [2021-03-25 14:32:50,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 14:32:50,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:50,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:32:50,200 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-25 14:32:50,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567287566] [2021-03-25 14:32:50,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:50,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:32:50,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253766961] [2021-03-25 14:32:50,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:32:50,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:50,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:32:50,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:32:50,202 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 183 [2021-03-25 14:32:50,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 199 flow. Second operand has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:50,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:50,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 183 [2021-03-25 14:32:50,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:50,311 INFO L129 PetriNetUnfolder]: 51/154 cut-off events. [2021-03-25 14:32:50,311 INFO L130 PetriNetUnfolder]: For 633/674 co-relation queries the response was YES. [2021-03-25 14:32:50,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 154 events. 51/154 cut-off events. For 633/674 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 772 event pairs, 6 based on Foata normal form. 27/176 useless extension candidates. Maximal degree in co-relation 514. Up to 40 conditions per place. [2021-03-25 14:32:50,313 INFO L132 encePairwiseOnDemand]: 177/183 looper letters, 8 selfloop transitions, 12 changer transitions 8/47 dead transitions. [2021-03-25 14:32:50,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 47 transitions, 337 flow [2021-03-25 14:32:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:32:50,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:32:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 978 transitions. [2021-03-25 14:32:50,316 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7634660421545667 [2021-03-25 14:32:50,316 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 978 transitions. [2021-03-25 14:32:50,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 978 transitions. [2021-03-25 14:32:50,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:50,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 978 transitions. [2021-03-25 14:32:50,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.71428571428572) internal successors, (978), 7 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:50,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:50,320 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:50,320 INFO L185 Difference]: Start difference. First operand has 47 places, 32 transitions, 199 flow. Second operand 7 states and 978 transitions. [2021-03-25 14:32:50,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 47 transitions, 337 flow [2021-03-25 14:32:50,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 295 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-25 14:32:50,323 INFO L241 Difference]: Finished difference. Result has 49 places, 37 transitions, 226 flow [2021-03-25 14:32:50,323 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2021-03-25 14:32:50,323 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2021-03-25 14:32:50,323 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:50,323 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 37 transitions, 226 flow [2021-03-25 14:32:50,324 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 37 transitions, 226 flow [2021-03-25 14:32:50,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 226 flow [2021-03-25 14:32:50,330 INFO L129 PetriNetUnfolder]: 30/103 cut-off events. [2021-03-25 14:32:50,331 INFO L130 PetriNetUnfolder]: For 145/150 co-relation queries the response was YES. [2021-03-25 14:32:50,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 103 events. 30/103 cut-off events. For 145/150 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 456 event pairs, 1 based on Foata normal form. 5/104 useless extension candidates. Maximal degree in co-relation 303. Up to 23 conditions per place. [2021-03-25 14:32:50,331 INFO L142 LiptonReduction]: Number of co-enabled transitions 222 [2021-03-25 14:32:50,509 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:32:50,879 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:32:50,992 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:32:51,140 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:32:51,478 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:32:51,589 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:32:51,904 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 90 [2021-03-25 14:32:51,959 INFO L154 LiptonReduction]: Checked pairs total: 169 [2021-03-25 14:32:51,960 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:32:51,960 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1637 [2021-03-25 14:32:51,960 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 232 flow [2021-03-25 14:32:51,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:51,960 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:51,961 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:51,961 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:32:51,961 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:51,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:51,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1300577871, now seen corresponding path program 1 times [2021-03-25 14:32:51,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:51,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184394941] [2021-03-25 14:32:51,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:51,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:51,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:51,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:51,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:32:51,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:51,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:32:52,000 INFO L142 QuantifierPusher]: treesize reduction 14, result has 36.4 percent of original size [2021-03-25 14:32:52,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 14:32:52,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:52,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:32:52,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:52,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:32:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:32:52,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184394941] [2021-03-25 14:32:52,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:52,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:32:52,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754607302] [2021-03-25 14:32:52,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:32:52,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:52,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:32:52,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:32:52,019 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 186 [2021-03-25 14:32:52,020 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 232 flow. Second operand has 8 states, 8 states have (on average 134.875) internal successors, (1079), 8 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:52,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:52,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 186 [2021-03-25 14:32:52,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:52,187 INFO L129 PetriNetUnfolder]: 97/270 cut-off events. [2021-03-25 14:32:52,187 INFO L130 PetriNetUnfolder]: For 928/1005 co-relation queries the response was YES. [2021-03-25 14:32:52,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 270 events. 97/270 cut-off events. For 928/1005 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1633 event pairs, 2 based on Foata normal form. 47/305 useless extension candidates. Maximal degree in co-relation 974. Up to 81 conditions per place. [2021-03-25 14:32:52,188 INFO L132 encePairwiseOnDemand]: 179/186 looper letters, 9 selfloop transitions, 15 changer transitions 26/70 dead transitions. [2021-03-25 14:32:52,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 598 flow [2021-03-25 14:32:52,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 14:32:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 14:32:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1373 transitions. [2021-03-25 14:32:52,191 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7381720430107527 [2021-03-25 14:32:52,191 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1373 transitions. [2021-03-25 14:32:52,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1373 transitions. [2021-03-25 14:32:52,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:52,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1373 transitions. [2021-03-25 14:32:52,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 137.3) internal successors, (1373), 10 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:52,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 186.0) internal successors, (2046), 11 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:52,197 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 186.0) internal successors, (2046), 11 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:52,197 INFO L185 Difference]: Start difference. First operand has 47 places, 37 transitions, 232 flow. Second operand 10 states and 1373 transitions. [2021-03-25 14:32:52,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 598 flow [2021-03-25 14:32:52,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 546 flow, removed 10 selfloop flow, removed 3 redundant places. [2021-03-25 14:32:52,201 INFO L241 Difference]: Finished difference. Result has 57 places, 41 transitions, 303 flow [2021-03-25 14:32:52,201 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=303, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2021-03-25 14:32:52,201 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2021-03-25 14:32:52,201 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:52,201 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 41 transitions, 303 flow [2021-03-25 14:32:52,201 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 41 transitions, 303 flow [2021-03-25 14:32:52,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 41 transitions, 303 flow [2021-03-25 14:32:52,215 INFO L129 PetriNetUnfolder]: 40/150 cut-off events. [2021-03-25 14:32:52,215 INFO L130 PetriNetUnfolder]: For 530/547 co-relation queries the response was YES. [2021-03-25 14:32:52,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 150 events. 40/150 cut-off events. For 530/547 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 825 event pairs, 1 based on Foata normal form. 7/149 useless extension candidates. Maximal degree in co-relation 530. Up to 42 conditions per place. [2021-03-25 14:32:52,216 INFO L142 LiptonReduction]: Number of co-enabled transitions 192 [2021-03-25 14:32:52,397 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:32:52,785 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 14:32:52,920 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 14:32:53,078 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:32:53,461 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:32:53,573 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:32:53,577 INFO L154 LiptonReduction]: Checked pairs total: 18 [2021-03-25 14:32:53,577 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:32:53,577 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1376 [2021-03-25 14:32:53,577 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 307 flow [2021-03-25 14:32:53,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 134.875) internal successors, (1079), 8 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:53,578 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:53,578 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:53,578 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:32:53,578 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:53,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:53,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1422675486, now seen corresponding path program 1 times [2021-03-25 14:32:53,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:53,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297861921] [2021-03-25 14:32:53,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:53,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:53,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:32:53,653 INFO L142 QuantifierPusher]: treesize reduction 16, result has 46.7 percent of original size [2021-03-25 14:32:53,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:32:53,662 INFO L142 QuantifierPusher]: treesize reduction 17, result has 50.0 percent of original size [2021-03-25 14:32:53,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:32:53,672 INFO L142 QuantifierPusher]: treesize reduction 17, result has 39.3 percent of original size [2021-03-25 14:32:53,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:32:53,682 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-25 14:32:53,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297861921] [2021-03-25 14:32:53,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:53,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:32:53,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053543455] [2021-03-25 14:32:53,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:32:53,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:53,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:32:53,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:32:53,684 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 188 [2021-03-25 14:32:53,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:53,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:53,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 188 [2021-03-25 14:32:53,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:53,773 INFO L129 PetriNetUnfolder]: 44/168 cut-off events. [2021-03-25 14:32:53,773 INFO L130 PetriNetUnfolder]: For 794/841 co-relation queries the response was YES. [2021-03-25 14:32:53,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 168 events. 44/168 cut-off events. For 794/841 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 960 event pairs, 3 based on Foata normal form. 26/186 useless extension candidates. Maximal degree in co-relation 656. Up to 44 conditions per place. [2021-03-25 14:32:53,774 INFO L132 encePairwiseOnDemand]: 178/188 looper letters, 4 selfloop transitions, 14 changer transitions 5/43 dead transitions. [2021-03-25 14:32:53,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 43 transitions, 361 flow [2021-03-25 14:32:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:32:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:32:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 803 transitions. [2021-03-25 14:32:53,776 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7118794326241135 [2021-03-25 14:32:53,777 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 803 transitions. [2021-03-25 14:32:53,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 803 transitions. [2021-03-25 14:32:53,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:53,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 803 transitions. [2021-03-25 14:32:53,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:53,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:53,779 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:53,780 INFO L185 Difference]: Start difference. First operand has 54 places, 41 transitions, 307 flow. Second operand 6 states and 803 transitions. [2021-03-25 14:32:53,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 43 transitions, 361 flow [2021-03-25 14:32:53,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 43 transitions, 358 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:32:53,782 INFO L241 Difference]: Finished difference. Result has 58 places, 37 transitions, 311 flow [2021-03-25 14:32:53,783 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=311, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2021-03-25 14:32:53,783 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2021-03-25 14:32:53,783 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:53,783 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 37 transitions, 311 flow [2021-03-25 14:32:53,783 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 37 transitions, 311 flow [2021-03-25 14:32:53,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 37 transitions, 311 flow [2021-03-25 14:32:53,793 INFO L129 PetriNetUnfolder]: 34/135 cut-off events. [2021-03-25 14:32:53,793 INFO L130 PetriNetUnfolder]: For 567/582 co-relation queries the response was YES. [2021-03-25 14:32:53,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 135 events. 34/135 cut-off events. For 567/582 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 725 event pairs, 2 based on Foata normal form. 6/135 useless extension candidates. Maximal degree in co-relation 559. Up to 38 conditions per place. [2021-03-25 14:32:53,794 INFO L142 LiptonReduction]: Number of co-enabled transitions 162 [2021-03-25 14:32:53,955 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:32:54,324 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 14:32:54,471 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:32:54,497 INFO L154 LiptonReduction]: Checked pairs total: 31 [2021-03-25 14:32:54,497 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:32:54,498 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 715 [2021-03-25 14:32:54,498 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 319 flow [2021-03-25 14:32:54,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:54,498 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:54,498 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:54,498 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:32:54,499 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:54,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash -315963919, now seen corresponding path program 1 times [2021-03-25 14:32:54,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:54,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485518018] [2021-03-25 14:32:54,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:54,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:54,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:54,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:54,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:54,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:54,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:54,529 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-25 14:32:54,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485518018] [2021-03-25 14:32:54,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:54,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:32:54,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270973165] [2021-03-25 14:32:54,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:32:54,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:54,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:32:54,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:32:54,531 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 190 [2021-03-25 14:32:54,531 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 319 flow. Second operand has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:54,531 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:54,531 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 190 [2021-03-25 14:32:54,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:54,579 INFO L129 PetriNetUnfolder]: 45/183 cut-off events. [2021-03-25 14:32:54,579 INFO L130 PetriNetUnfolder]: For 1059/1134 co-relation queries the response was YES. [2021-03-25 14:32:54,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 183 events. 45/183 cut-off events. For 1059/1134 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1076 event pairs, 0 based on Foata normal form. 26/203 useless extension candidates. Maximal degree in co-relation 816. Up to 56 conditions per place. [2021-03-25 14:32:54,580 INFO L132 encePairwiseOnDemand]: 183/190 looper letters, 3 selfloop transitions, 1 changer transitions 17/43 dead transitions. [2021-03-25 14:32:54,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 43 transitions, 442 flow [2021-03-25 14:32:54,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:32:54,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:32:54,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 638 transitions. [2021-03-25 14:32:54,582 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8394736842105263 [2021-03-25 14:32:54,583 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 638 transitions. [2021-03-25 14:32:54,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 638 transitions. [2021-03-25 14:32:54,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:54,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 638 transitions. [2021-03-25 14:32:54,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:54,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:54,585 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:54,585 INFO L185 Difference]: Start difference. First operand has 58 places, 37 transitions, 319 flow. Second operand 4 states and 638 transitions. [2021-03-25 14:32:54,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 43 transitions, 442 flow [2021-03-25 14:32:54,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 43 transitions, 419 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:32:54,588 INFO L241 Difference]: Finished difference. Result has 59 places, 26 transitions, 179 flow [2021-03-25 14:32:54,588 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=59, PETRI_TRANSITIONS=26} [2021-03-25 14:32:54,588 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2021-03-25 14:32:54,588 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:54,589 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 26 transitions, 179 flow [2021-03-25 14:32:54,589 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 26 transitions, 179 flow [2021-03-25 14:32:54,589 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 26 transitions, 179 flow [2021-03-25 14:32:54,595 INFO L129 PetriNetUnfolder]: 11/61 cut-off events. [2021-03-25 14:32:54,595 INFO L130 PetriNetUnfolder]: For 189/194 co-relation queries the response was YES. [2021-03-25 14:32:54,595 INFO L84 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 61 events. 11/61 cut-off events. For 189/194 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 199 event pairs, 0 based on Foata normal form. 4/65 useless extension candidates. Maximal degree in co-relation 211. Up to 15 conditions per place. [2021-03-25 14:32:54,595 INFO L142 LiptonReduction]: Number of co-enabled transitions 28 [2021-03-25 14:32:55,027 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-25 14:32:55,151 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-25 14:32:55,208 INFO L154 LiptonReduction]: Checked pairs total: 16 [2021-03-25 14:32:55,208 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:32:55,208 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 620 [2021-03-25 14:32:55,208 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 23 transitions, 183 flow [2021-03-25 14:32:55,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:55,209 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:55,209 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:55,209 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:32:55,209 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:55,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:55,209 INFO L82 PathProgramCache]: Analyzing trace with hash 265956739, now seen corresponding path program 1 times [2021-03-25 14:32:55,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:55,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461998724] [2021-03-25 14:32:55,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:32:55,225 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:32:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:32:55,240 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:32:55,257 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:32:55,257 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:32:55,257 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:32:55,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:32:55 BasicIcfg [2021-03-25 14:32:55,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:32:55,308 INFO L168 Benchmark]: Toolchain (without parser) took 24825.81 ms. Allocated memory was 358.6 MB in the beginning and 778.0 MB in the end (delta: 419.4 MB). Free memory was 321.8 MB in the beginning and 542.8 MB in the end (delta: -221.0 MB). Peak memory consumption was 200.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:32:55,308 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 358.6 MB. Free memory was 339.9 MB in the beginning and 339.8 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:32:55,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.64 ms. Allocated memory is still 358.6 MB. Free memory was 321.6 MB in the beginning and 317.9 MB in the end (delta: 3.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:32:55,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.03 ms. Allocated memory is still 358.6 MB. Free memory was 317.9 MB in the beginning and 314.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:32:55,309 INFO L168 Benchmark]: Boogie Preprocessor took 19.56 ms. Allocated memory is still 358.6 MB. Free memory was 314.8 MB in the beginning and 312.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:32:55,309 INFO L168 Benchmark]: RCFGBuilder took 1588.18 ms. Allocated memory is still 358.6 MB. Free memory was 312.7 MB in the beginning and 294.0 MB in the end (delta: 18.7 MB). Peak memory consumption was 163.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:32:55,309 INFO L168 Benchmark]: TraceAbstraction took 22806.06 ms. Allocated memory was 358.6 MB in the beginning and 778.0 MB in the end (delta: 419.4 MB). Free memory was 293.0 MB in the beginning and 542.8 MB in the end (delta: -249.8 MB). Peak memory consumption was 169.6 MB. Max. memory is 16.0 GB. [2021-03-25 14:32:55,310 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.10 ms. Allocated memory is still 358.6 MB. Free memory was 339.9 MB in the beginning and 339.8 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 374.64 ms. Allocated memory is still 358.6 MB. Free memory was 321.6 MB in the beginning and 317.9 MB in the end (delta: 3.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 33.03 ms. Allocated memory is still 358.6 MB. Free memory was 317.9 MB in the beginning and 314.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 19.56 ms. Allocated memory is still 358.6 MB. Free memory was 314.8 MB in the beginning and 312.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1588.18 ms. Allocated memory is still 358.6 MB. Free memory was 312.7 MB in the beginning and 294.0 MB in the end (delta: 18.7 MB). Peak memory consumption was 163.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 22806.06 ms. Allocated memory was 358.6 MB in the beginning and 778.0 MB in the end (delta: 419.4 MB). Free memory was 293.0 MB in the beginning and 542.8 MB in the end (delta: -249.8 MB). Peak memory consumption was 169.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7190.8ms, 106 PlacesBefore, 48 PlacesAfterwards, 98 TransitionsBefore, 39 TransitionsAfterwards, 1738 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, 2986 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1504, positive: 1420, positive conditional: 0, positive unconditional: 1420, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1101, positive: 1059, positive conditional: 0, positive unconditional: 1059, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1101, positive: 1059, positive conditional: 0, positive unconditional: 1059, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1101, positive: 1054, positive conditional: 0, positive unconditional: 1054, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 612, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 599, negative conditional: 0, negative unconditional: 599, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1504, positive: 361, positive conditional: 0, positive unconditional: 361, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 1101, unknown conditional: 0, unknown unconditional: 1101] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 122, Positive conditional cache size: 0, Positive unconditional cache size: 122, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3260.5ms, 45 PlacesBefore, 31 PlacesAfterwards, 32 TransitionsBefore, 22 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 976 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 390, positive: 316, positive conditional: 0, positive unconditional: 316, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 64, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 64, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 204, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 390, positive: 264, positive conditional: 0, positive unconditional: 264, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 64, unknown conditional: 0, unknown unconditional: 64] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1196.7ms, 32 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 645 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 249, positive: 195, positive conditional: 0, positive unconditional: 195, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 34, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 249, positive: 195, positive conditional: 0, positive unconditional: 195, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.7ms, 35 PlacesBefore, 35 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 266 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 120, positive: 101, positive conditional: 0, positive unconditional: 101, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.8ms, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 276 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 113, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 113, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.6ms, 46 PlacesBefore, 46 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 259 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 91, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 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: 38, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 125, Positive conditional cache size: 0, Positive unconditional cache size: 125, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 640.5ms, 52 PlacesBefore, 52 PlacesAfterwards, 42 TransitionsBefore, 40 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 474 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 211, positive: 192, positive conditional: 0, positive unconditional: 192, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 16, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 211, positive: 176, positive conditional: 0, positive unconditional: 176, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3854.5ms, 51 PlacesBefore, 47 PlacesAfterwards, 35 TransitionsBefore, 32 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 511 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 257, positive: 224, positive conditional: 0, positive unconditional: 224, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 257, positive: 218, positive conditional: 0, positive unconditional: 218, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1636.0ms, 49 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 169 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 102, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1375.7ms, 57 PlacesBefore, 54 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 18 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 18, positive: 18, positive conditional: 0, positive unconditional: 18, 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): 126, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 714.3ms, 58 PlacesBefore, 58 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 31 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 619.2ms, 59 PlacesBefore, 53 PlacesAfterwards, 26 TransitionsBefore, 23 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 16 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 16, positive: 16, positive conditional: 0, positive unconditional: 16, 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): 24, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1114; [L826] FCALL, FORK 0 pthread_create(&t1114, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1115; [L828] FCALL, FORK 0 pthread_create(&t1115, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t1116; [L830] FCALL, FORK 0 pthread_create(&t1116, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 [L794] 3 z = 1 [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y = 1 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 22693.2ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 906.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7239.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 43 SDtfs, 42 SDslu, 22 SDs, 0 SdLazy, 367 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 334.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 279.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred in iteration=10, InterpolantAutomatonStates: 62, 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.8ms SsaConstructionTime, 326.6ms SatisfiabilityAnalysisTime, 598.4ms InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 918 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...