/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 16:05:29,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 16:05:29,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 16:05:29,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 16:05:29,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 16:05:29,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 16:05:29,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 16:05:29,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 16:05:29,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 16:05:29,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 16:05:29,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 16:05:29,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 16:05:29,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 16:05:29,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 16:05:29,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 16:05:29,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 16:05:29,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 16:05:29,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 16:05:29,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 16:05:29,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 16:05:29,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 16:05:29,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 16:05:29,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 16:05:29,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 16:05:29,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 16:05:29,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 16:05:29,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 16:05:29,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 16:05:29,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 16:05:29,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 16:05:29,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 16:05:29,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 16:05:29,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 16:05:29,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 16:05:29,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 16:05:29,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 16:05:29,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 16:05:29,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 16:05:29,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 16:05:29,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 16:05:29,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 16:05:29,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 16:05:29,444 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 16:05:29,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 16:05:29,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 16:05:29,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 16:05:29,445 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 16:05:29,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 16:05:29,445 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 16:05:29,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 16:05:29,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 16:05:29,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 16:05:29,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 16:05:29,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 16:05:29,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 16:05:29,446 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 16:05:29,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 16:05:29,446 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 16:05:29,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 16:05:29,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 16:05:29,446 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 16:05:29,447 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 16:05:29,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 16:05:29,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 16:05:29,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 16:05:29,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 16:05:29,447 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 16:05:29,447 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 16:05:29,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 16:05:29,447 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 16:05:29,447 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 16:05:29,448 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 16:05:29,448 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-06-11 16:05:29,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 16:05:29,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 16:05:29,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 16:05:29,732 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 16:05:29,733 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 16:05:29,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i [2021-06-11 16:05:29,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e558f1cf/52655df4d4a9440faff3504b54b53ebb/FLAG9eae518c7 [2021-06-11 16:05:30,172 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 16:05:30,176 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i [2021-06-11 16:05:30,189 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e558f1cf/52655df4d4a9440faff3504b54b53ebb/FLAG9eae518c7 [2021-06-11 16:05:30,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e558f1cf/52655df4d4a9440faff3504b54b53ebb [2021-06-11 16:05:30,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 16:05:30,208 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 16:05:30,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 16:05:30,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 16:05:30,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 16:05:30,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:05:30" (1/1) ... [2021-06-11 16:05:30,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7b7102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:30, skipping insertion in model container [2021-06-11 16:05:30,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:05:30" (1/1) ... [2021-06-11 16:05:30,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 16:05:30,262 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 16:05:30,447 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/safe011_pso.opt.i[949,962] [2021-06-11 16:05:30,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:05:30,613 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 16:05:30,625 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/safe011_pso.opt.i[949,962] [2021-06-11 16:05:30,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:05:30,705 INFO L208 MainTranslator]: Completed translation [2021-06-11 16:05:30,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:30 WrapperNode [2021-06-11 16:05:30,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 16:05:30,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 16:05:30,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 16:05:30,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 16:05:30,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:30" (1/1) ... [2021-06-11 16:05:30,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:30" (1/1) ... [2021-06-11 16:05:30,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 16:05:30,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 16:05:30,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 16:05:30,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 16:05:30,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:30" (1/1) ... [2021-06-11 16:05:30,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:30" (1/1) ... [2021-06-11 16:05:30,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:30" (1/1) ... [2021-06-11 16:05:30,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:30" (1/1) ... [2021-06-11 16:05:30,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:30" (1/1) ... [2021-06-11 16:05:30,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:30" (1/1) ... [2021-06-11 16:05:30,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:30" (1/1) ... [2021-06-11 16:05:30,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 16:05:30,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 16:05:30,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 16:05:30,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 16:05:30,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05: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-06-11 16:05:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 16:05:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 16:05:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 16:05:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 16:05:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 16:05:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 16:05:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 16:05:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 16:05:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 16:05:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 16:05:30,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 16:05:30,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 16:05:30,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 16:05:30,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 16:05:30,829 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 16:05:32,331 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 16:05:32,331 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 16:05:32,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:05:32 BoogieIcfgContainer [2021-06-11 16:05:32,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 16:05:32,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 16:05:32,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 16:05:32,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 16:05:32,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 04:05:30" (1/3) ... [2021-06-11 16:05:32,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f53fcc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:05:32, skipping insertion in model container [2021-06-11 16:05:32,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:30" (2/3) ... [2021-06-11 16:05:32,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f53fcc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:05:32, skipping insertion in model container [2021-06-11 16:05:32,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:05:32" (3/3) ... [2021-06-11 16:05:32,339 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_pso.opt.i [2021-06-11 16:05:32,344 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 16:05:32,346 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 16:05:32,347 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 16:05:32,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,373 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,376 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,376 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,376 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,377 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,377 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,377 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,377 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,377 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,386 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,386 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,387 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,387 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,391 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,392 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,392 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,395 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,397 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,402 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,402 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:32,403 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 16:05:32,415 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 16:05:32,435 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 16:05:32,435 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 16:05:32,435 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 16:05:32,435 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 16:05:32,435 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 16:05:32,435 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 16:05:32,435 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 16:05:32,435 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 16:05:32,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-06-11 16:05:32,477 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-06-11 16:05:32,478 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:05:32,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-06-11 16:05:32,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-06-11 16:05:32,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-06-11 16:05:32,485 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:32,493 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-06-11 16:05:32,495 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-06-11 16:05:32,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-06-11 16:05:32,509 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-06-11 16:05:32,510 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:05:32,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-06-11 16:05:32,512 INFO L151 LiptonReduction]: Number of co-enabled transitions 1686 [2021-06-11 16:05:32,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:32,607 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:32,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:32,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:32,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:32,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:32,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:32,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:32,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:32,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:32,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:32,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:32,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:32,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:32,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:32,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:32,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:32,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:32,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:32,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:32,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:32,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:32,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:32,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:32,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:32,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:32,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:32,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:32,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:33,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,071 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:33,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:33,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:33,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,160 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 16:05:33,160 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:33,179 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:33,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,365 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:33,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:33,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:33,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:33,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:33,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:33,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,560 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:33,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:33,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:33,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:33,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:33,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:33,695 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 16:05:33,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:33,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:33,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:33,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:33,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:33,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:33,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:33,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:34,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:34,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:34,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:34,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:34,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:34,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:34,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:34,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:34,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:34,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:34,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:34,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:34,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:34,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:34,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:34,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:34,490 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 16:05:34,831 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 16:05:34,943 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 16:05:34,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:34,956 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:34,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:34,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 16:05:34,959 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:34,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:34,960 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 16:05:34,960 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:34,962 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:34,964 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-11 16:05:34,964 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:34,965 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-11 16:05:34,966 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-11 16:05:34,966 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:34,967 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:34,968 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-11 16:05:34,969 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-11 16:05:34,969 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:34,970 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:34,974 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-11 16:05:35,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:35,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,203 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:35,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:35,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:35,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:35,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,336 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:35,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:35,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:35,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:35,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:35,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,539 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 16:05:35,570 INFO L142 QuantifierPusher]: treesize reduction 84, result has 91.1 percent of original size [2021-06-11 16:05:35,575 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 16:05:35,579 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 16:05:35,583 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 16:05:35,586 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,589 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 16:05:35,589 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,590 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 16:05:35,591 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 16:05:35,591 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:35,592 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,593 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 16:05:35,593 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:35,594 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,594 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 16:05:35,594 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:35,595 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,599 INFO L147 QuantifierPusher]: treesize reduction 185, result has 40.1 percent of original size 124 [2021-06-11 16:05:35,599 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,601 INFO L142 QuantifierPusher]: treesize reduction 185, result has 55.3 percent of original size [2021-06-11 16:05:35,601 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 4, 3, 2, 1] term [2021-06-11 16:05:35,602 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:35,603 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,603 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 2, 1] term [2021-06-11 16:05:35,604 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:35,605 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,606 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 2, 1] term [2021-06-11 16:05:35,606 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:35,607 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,609 INFO L147 QuantifierPusher]: treesize reduction 411, result has 23.2 percent of original size 124 [2021-06-11 16:05:35,610 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 16:05:35,610 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:35,611 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,611 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 16:05:35,612 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:35,613 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,613 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 16:05:35,613 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:35,614 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,615 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 16:05:35,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:35,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,621 INFO L147 QuantifierPusher]: treesize reduction 22, result has 4.3 percent of original size 1 [2021-06-11 16:05:35,622 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 4, 3, 2, 1] term [2021-06-11 16:05:35,622 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:35,623 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,623 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 3, 1] term [2021-06-11 16:05:35,623 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:35,624 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,626 INFO L147 QuantifierPusher]: treesize reduction 85, result has 41.8 percent of original size 61 [2021-06-11 16:05:35,633 INFO L147 QuantifierPusher]: treesize reduction 1599, result has 16.5 percent of original size 317 [2021-06-11 16:05:35,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,726 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:35,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:35,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:35,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:35,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,973 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,975 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 16:05:35,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:35,978 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,980 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 16:05:35,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 16:05:35,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:35,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:35,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 16:05:35,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 16:05:36,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:36,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:36,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:36,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:36,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:36,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:36,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:36,678 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-06-11 16:05:36,822 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-11 16:05:37,115 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-06-11 16:05:37,227 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-11 16:05:37,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:37,248 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:37,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:37,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:37,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:37,261 INFO L163 LiptonReduction]: Checked pairs total: 4853 [2021-06-11 16:05:37,261 INFO L165 LiptonReduction]: Total number of compositions: 86 [2021-06-11 16:05:37,264 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4780 [2021-06-11 16:05:37,273 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2021-06-11 16:05:37,273 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:05:37,273 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:37,273 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-06-11 16:05:37,273 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:37,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:37,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1021375556, now seen corresponding path program 1 times [2021-06-11 16:05:37,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:37,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499622789] [2021-06-11 16:05:37,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:37,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:37,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:05:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:37,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499622789] [2021-06-11 16:05:37,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:37,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:05:37,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569510261] [2021-06-11 16:05:37,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:05:37,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:37,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:05:37,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:05:37,434 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2021-06-11 16:05:37,438 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:37,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:37,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2021-06-11 16:05:37,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:37,505 INFO L129 PetriNetUnfolder]: 49/134 cut-off events. [2021-06-11 16:05:37,506 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:05:37,507 INFO L84 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 134 events. 49/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 592 event pairs, 27 based on Foata normal form. 23/139 useless extension candidates. Maximal degree in co-relation 220. Up to 65 conditions per place. [2021-06-11 16:05:37,509 INFO L132 encePairwiseOnDemand]: 178/183 looper letters, 9 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2021-06-11 16:05:37,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 89 flow [2021-06-11 16:05:37,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:05:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:05:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2021-06-11 16:05:37,523 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8597449908925319 [2021-06-11 16:05:37,523 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2021-06-11 16:05:37,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2021-06-11 16:05:37,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:37,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2021-06-11 16:05:37,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:37,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:37,534 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:37,535 INFO L185 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 472 transitions. [2021-06-11 16:05:37,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 89 flow [2021-06-11 16:05:37,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 86 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 16:05:37,538 INFO L241 Difference]: Finished difference. Result has 34 places, 25 transitions, 60 flow [2021-06-11 16:05:37,539 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2021-06-11 16:05:37,539 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2021-06-11 16:05:37,539 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:37,540 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 60 flow [2021-06-11 16:05:37,540 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 60 flow [2021-06-11 16:05:37,540 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 60 flow [2021-06-11 16:05:37,543 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-06-11 16:05:37,543 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:05:37,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 16:05:37,543 INFO L151 LiptonReduction]: Number of co-enabled transitions 304 [2021-06-11 16:05:38,292 WARN L205 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 203 [2021-06-11 16:05:38,596 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2021-06-11 16:05:40,357 WARN L205 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 333 DAG size of output: 286 [2021-06-11 16:05:41,167 WARN L205 SmtUtils]: Spent 807.00 ms on a formula simplification that was a NOOP. DAG size: 282 [2021-06-11 16:05:41,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:41,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:42,109 WARN L205 SmtUtils]: Spent 923.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2021-06-11 16:05:42,398 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-06-11 16:05:43,659 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 313 DAG size of output: 269 [2021-06-11 16:05:44,245 WARN L205 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-06-11 16:05:44,533 INFO L163 LiptonReduction]: Checked pairs total: 684 [2021-06-11 16:05:44,533 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 16:05:44,533 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6994 [2021-06-11 16:05:44,534 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-06-11 16:05:44,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:44,534 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:44,534 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:44,535 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 16:05:44,535 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:44,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:44,535 INFO L82 PathProgramCache]: Analyzing trace with hash -154838526, now seen corresponding path program 1 times [2021-06-11 16:05:44,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:44,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330798998] [2021-06-11 16:05:44,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:44,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:44,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:44,653 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-11 16:05:44,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 16:05:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:44,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330798998] [2021-06-11 16:05:44,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:44,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:05:44,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971307413] [2021-06-11 16:05:44,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:05:44,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:44,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:05:44,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:05:44,669 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 185 [2021-06-11 16:05:44,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:44,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:44,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 185 [2021-06-11 16:05:44,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:44,713 INFO L129 PetriNetUnfolder]: 7/41 cut-off events. [2021-06-11 16:05:44,714 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:05:44,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 41 events. 7/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 105 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 61. Up to 10 conditions per place. [2021-06-11 16:05:44,714 INFO L132 encePairwiseOnDemand]: 180/185 looper letters, 3 selfloop transitions, 3 changer transitions 7/31 dead transitions. [2021-06-11 16:05:44,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 96 flow [2021-06-11 16:05:44,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:05:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:05:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 733 transitions. [2021-06-11 16:05:44,717 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7924324324324324 [2021-06-11 16:05:44,717 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 733 transitions. [2021-06-11 16:05:44,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 733 transitions. [2021-06-11 16:05:44,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:44,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 733 transitions. [2021-06-11 16:05:44,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:44,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:44,721 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:44,721 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 733 transitions. [2021-06-11 16:05:44,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 96 flow [2021-06-11 16:05:44,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:05:44,723 INFO L241 Difference]: Finished difference. Result has 37 places, 24 transitions, 73 flow [2021-06-11 16:05:44,723 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=73, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2021-06-11 16:05:44,723 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2021-06-11 16:05:44,723 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:44,723 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 24 transitions, 73 flow [2021-06-11 16:05:44,724 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 24 transitions, 73 flow [2021-06-11 16:05:44,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 73 flow [2021-06-11 16:05:44,729 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-06-11 16:05:44,729 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-06-11 16:05:44,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-06-11 16:05:44,729 INFO L151 LiptonReduction]: Number of co-enabled transitions 262 [2021-06-11 16:05:44,734 INFO L163 LiptonReduction]: Checked pairs total: 250 [2021-06-11 16:05:44,735 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:44,735 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-06-11 16:05:44,735 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 73 flow [2021-06-11 16:05:44,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:44,736 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:44,736 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:44,736 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 16:05:44,736 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:44,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:44,736 INFO L82 PathProgramCache]: Analyzing trace with hash -154834656, now seen corresponding path program 1 times [2021-06-11 16:05:44,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:44,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171299100] [2021-06-11 16:05:44,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:44,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:44,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:44,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171299100] [2021-06-11 16:05:44,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:44,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:05:44,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767460624] [2021-06-11 16:05:44,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:05:44,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:44,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:05:44,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:05:44,803 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 185 [2021-06-11 16:05:44,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:44,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:44,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 185 [2021-06-11 16:05:44,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:44,811 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-06-11 16:05:44,812 INFO L130 PetriNetUnfolder]: For 8/9 co-relation queries the response was YES. [2021-06-11 16:05:44,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 32 events. 3/32 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 1 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2021-06-11 16:05:44,812 INFO L132 encePairwiseOnDemand]: 182/185 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2021-06-11 16:05:44,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 79 flow [2021-06-11 16:05:44,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:05:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:05:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2021-06-11 16:05:44,814 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8558558558558559 [2021-06-11 16:05:44,814 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 475 transitions. [2021-06-11 16:05:44,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 475 transitions. [2021-06-11 16:05:44,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:44,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 475 transitions. [2021-06-11 16:05:44,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:44,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:44,816 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:44,816 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 73 flow. Second operand 3 states and 475 transitions. [2021-06-11 16:05:44,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 79 flow [2021-06-11 16:05:44,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 72 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-06-11 16:05:44,817 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 74 flow [2021-06-11 16:05:44,817 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2021-06-11 16:05:44,817 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2021-06-11 16:05:44,817 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:44,817 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 74 flow [2021-06-11 16:05:44,818 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 74 flow [2021-06-11 16:05:44,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 74 flow [2021-06-11 16:05:44,821 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-06-11 16:05:44,821 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-06-11 16:05:44,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-06-11 16:05:44,821 INFO L151 LiptonReduction]: Number of co-enabled transitions 260 [2021-06-11 16:05:44,822 INFO L163 LiptonReduction]: Checked pairs total: 226 [2021-06-11 16:05:44,822 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:44,823 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-06-11 16:05:44,823 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 74 flow [2021-06-11 16:05:44,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:44,823 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:44,823 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:44,824 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 16:05:44,824 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:44,824 INFO L82 PathProgramCache]: Analyzing trace with hash -504910583, now seen corresponding path program 1 times [2021-06-11 16:05:44,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:44,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355418496] [2021-06-11 16:05:44,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:44,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:44,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:44,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:44,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:44,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355418496] [2021-06-11 16:05:44,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:44,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:05:44,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592255059] [2021-06-11 16:05:44,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:05:44,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:44,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:05:44,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:05:44,872 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 185 [2021-06-11 16:05:44,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:44,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:44,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 185 [2021-06-11 16:05:44,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:44,888 INFO L129 PetriNetUnfolder]: 4/43 cut-off events. [2021-06-11 16:05:44,888 INFO L130 PetriNetUnfolder]: For 29/33 co-relation queries the response was YES. [2021-06-11 16:05:44,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 43 events. 4/43 cut-off events. For 29/33 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 120 event pairs, 1 based on Foata normal form. 4/46 useless extension candidates. Maximal degree in co-relation 71. Up to 13 conditions per place. [2021-06-11 16:05:44,889 INFO L132 encePairwiseOnDemand]: 181/185 looper letters, 1 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2021-06-11 16:05:44,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 89 flow [2021-06-11 16:05:44,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 16:05:44,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 16:05:44,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 611 transitions. [2021-06-11 16:05:44,890 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8256756756756757 [2021-06-11 16:05:44,890 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 611 transitions. [2021-06-11 16:05:44,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 611 transitions. [2021-06-11 16:05:44,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:44,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 611 transitions. [2021-06-11 16:05:44,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:44,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:44,893 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:44,893 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 74 flow. Second operand 4 states and 611 transitions. [2021-06-11 16:05:44,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 89 flow [2021-06-11 16:05:44,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 25 transitions, 83 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:05:44,894 INFO L241 Difference]: Finished difference. Result has 37 places, 24 transitions, 84 flow [2021-06-11 16:05:44,894 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2021-06-11 16:05:44,894 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2021-06-11 16:05:44,895 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:44,895 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 24 transitions, 84 flow [2021-06-11 16:05:44,895 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 24 transitions, 84 flow [2021-06-11 16:05:44,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 24 transitions, 84 flow [2021-06-11 16:05:44,898 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-06-11 16:05:44,898 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-11 16:05:44,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 32 events. 3/32 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 57. Up to 10 conditions per place. [2021-06-11 16:05:44,899 INFO L151 LiptonReduction]: Number of co-enabled transitions 232 [2021-06-11 16:05:45,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:45,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:45,018 INFO L163 LiptonReduction]: Checked pairs total: 327 [2021-06-11 16:05:45,018 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 16:05:45,018 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 123 [2021-06-11 16:05:45,019 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 82 flow [2021-06-11 16:05:45,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,019 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:45,019 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:45,019 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-11 16:05:45,019 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:45,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:45,019 INFO L82 PathProgramCache]: Analyzing trace with hash -398927183, now seen corresponding path program 1 times [2021-06-11 16:05:45,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:45,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503589003] [2021-06-11 16:05:45,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:45,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:45,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:05:45,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:45,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:05:45,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:45,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:05:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:45,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503589003] [2021-06-11 16:05:45,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:45,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:05:45,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199468210] [2021-06-11 16:05:45,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:05:45,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:45,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:05:45,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:05:45,066 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 186 [2021-06-11 16:05:45,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:45,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 186 [2021-06-11 16:05:45,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:45,107 INFO L129 PetriNetUnfolder]: 69/158 cut-off events. [2021-06-11 16:05:45,107 INFO L130 PetriNetUnfolder]: For 182/182 co-relation queries the response was YES. [2021-06-11 16:05:45,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 158 events. 69/158 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 677 event pairs, 40 based on Foata normal form. 3/145 useless extension candidates. Maximal degree in co-relation 380. Up to 108 conditions per place. [2021-06-11 16:05:45,109 INFO L132 encePairwiseOnDemand]: 181/186 looper letters, 9 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2021-06-11 16:05:45,109 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 28 transitions, 122 flow [2021-06-11 16:05:45,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:05:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:05:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2021-06-11 16:05:45,110 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8154121863799283 [2021-06-11 16:05:45,111 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2021-06-11 16:05:45,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2021-06-11 16:05:45,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:45,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2021-06-11 16:05:45,112 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-06-11 16:05:45,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,113 INFO L185 Difference]: Start difference. First operand has 36 places, 23 transitions, 82 flow. Second operand 3 states and 455 transitions. [2021-06-11 16:05:45,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 28 transitions, 122 flow [2021-06-11 16:05:45,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 28 transitions, 107 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-06-11 16:05:45,114 INFO L241 Difference]: Finished difference. Result has 35 places, 26 transitions, 96 flow [2021-06-11 16:05:45,114 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2021-06-11 16:05:45,115 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2021-06-11 16:05:45,115 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:45,115 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 96 flow [2021-06-11 16:05:45,115 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 96 flow [2021-06-11 16:05:45,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 96 flow [2021-06-11 16:05:45,122 INFO L129 PetriNetUnfolder]: 24/74 cut-off events. [2021-06-11 16:05:45,122 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-11 16:05:45,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 74 events. 24/74 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 264 event pairs, 10 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 157. Up to 41 conditions per place. [2021-06-11 16:05:45,123 INFO L151 LiptonReduction]: Number of co-enabled transitions 240 [2021-06-11 16:05:45,124 INFO L163 LiptonReduction]: Checked pairs total: 78 [2021-06-11 16:05:45,124 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:45,125 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-06-11 16:05:45,125 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 96 flow [2021-06-11 16:05:45,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,125 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:45,125 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:45,126 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-11 16:05:45,126 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:45,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:45,126 INFO L82 PathProgramCache]: Analyzing trace with hash -606613599, now seen corresponding path program 1 times [2021-06-11 16:05:45,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:45,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623527079] [2021-06-11 16:05:45,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:45,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:45,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:05:45,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:45,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:45,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:45,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 16:05:45,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:45,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:45,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623527079] [2021-06-11 16:05:45,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:45,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:05:45,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567886138] [2021-06-11 16:05:45,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:05:45,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:45,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:05:45,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:05:45,205 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 186 [2021-06-11 16:05:45,205 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 135.83333333333334) internal successors, (815), 6 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,205 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:45,205 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 186 [2021-06-11 16:05:45,205 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:45,276 INFO L129 PetriNetUnfolder]: 86/201 cut-off events. [2021-06-11 16:05:45,277 INFO L130 PetriNetUnfolder]: For 141/192 co-relation queries the response was YES. [2021-06-11 16:05:45,277 INFO L84 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 201 events. 86/201 cut-off events. For 141/192 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 922 event pairs, 21 based on Foata normal form. 7/195 useless extension candidates. Maximal degree in co-relation 509. Up to 119 conditions per place. [2021-06-11 16:05:45,278 INFO L132 encePairwiseOnDemand]: 179/186 looper letters, 11 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2021-06-11 16:05:45,278 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 153 flow [2021-06-11 16:05:45,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:05:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:05:45,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2021-06-11 16:05:45,280 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7430107526881721 [2021-06-11 16:05:45,280 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2021-06-11 16:05:45,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2021-06-11 16:05:45,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:45,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2021-06-11 16:05:45,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,283 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,283 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 96 flow. Second operand 5 states and 691 transitions. [2021-06-11 16:05:45,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 153 flow [2021-06-11 16:05:45,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 16:05:45,284 INFO L241 Difference]: Finished difference. Result has 40 places, 30 transitions, 141 flow [2021-06-11 16:05:45,284 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2021-06-11 16:05:45,284 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2021-06-11 16:05:45,284 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:45,284 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 141 flow [2021-06-11 16:05:45,285 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 141 flow [2021-06-11 16:05:45,285 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 141 flow [2021-06-11 16:05:45,296 INFO L129 PetriNetUnfolder]: 47/122 cut-off events. [2021-06-11 16:05:45,296 INFO L130 PetriNetUnfolder]: For 153/200 co-relation queries the response was YES. [2021-06-11 16:05:45,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 122 events. 47/122 cut-off events. For 153/200 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 519 event pairs, 12 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 345. Up to 70 conditions per place. [2021-06-11 16:05:45,297 INFO L151 LiptonReduction]: Number of co-enabled transitions 284 [2021-06-11 16:05:45,486 INFO L163 LiptonReduction]: Checked pairs total: 60 [2021-06-11 16:05:45,487 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:45,487 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 203 [2021-06-11 16:05:45,487 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 141 flow [2021-06-11 16:05:45,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 135.83333333333334) internal successors, (815), 6 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,488 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:45,488 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:45,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 16:05:45,488 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:45,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:45,488 INFO L82 PathProgramCache]: Analyzing trace with hash 113309473, now seen corresponding path program 2 times [2021-06-11 16:05:45,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:45,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011342363] [2021-06-11 16:05:45,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:45,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:45,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:05:45,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:45,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 16:05:45,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:45,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 16:05:45,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:45,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 16:05:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:45,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011342363] [2021-06-11 16:05:45,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:45,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:05:45,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972230270] [2021-06-11 16:05:45,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:05:45,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:45,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:05:45,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:05:45,554 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 186 [2021-06-11 16:05:45,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,555 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:45,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 186 [2021-06-11 16:05:45,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:45,623 INFO L129 PetriNetUnfolder]: 87/198 cut-off events. [2021-06-11 16:05:45,623 INFO L130 PetriNetUnfolder]: For 295/363 co-relation queries the response was YES. [2021-06-11 16:05:45,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 198 events. 87/198 cut-off events. For 295/363 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 888 event pairs, 31 based on Foata normal form. 4/187 useless extension candidates. Maximal degree in co-relation 645. Up to 135 conditions per place. [2021-06-11 16:05:45,624 INFO L132 encePairwiseOnDemand]: 178/186 looper letters, 14 selfloop transitions, 10 changer transitions 0/39 dead transitions. [2021-06-11 16:05:45,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 225 flow [2021-06-11 16:05:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:05:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:05:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 704 transitions. [2021-06-11 16:05:45,627 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7569892473118279 [2021-06-11 16:05:45,627 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 704 transitions. [2021-06-11 16:05:45,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 704 transitions. [2021-06-11 16:05:45,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:45,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 704 transitions. [2021-06-11 16:05:45,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,630 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,630 INFO L185 Difference]: Start difference. First operand has 40 places, 30 transitions, 141 flow. Second operand 5 states and 704 transitions. [2021-06-11 16:05:45,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 225 flow [2021-06-11 16:05:45,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 217 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-06-11 16:05:45,632 INFO L241 Difference]: Finished difference. Result has 44 places, 37 transitions, 206 flow [2021-06-11 16:05:45,632 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2021-06-11 16:05:45,632 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2021-06-11 16:05:45,632 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:45,632 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 206 flow [2021-06-11 16:05:45,633 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 37 transitions, 206 flow [2021-06-11 16:05:45,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 206 flow [2021-06-11 16:05:45,656 INFO L129 PetriNetUnfolder]: 81/175 cut-off events. [2021-06-11 16:05:45,656 INFO L130 PetriNetUnfolder]: For 397/473 co-relation queries the response was YES. [2021-06-11 16:05:45,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 175 events. 81/175 cut-off events. For 397/473 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 757 event pairs, 21 based on Foata normal form. 3/153 useless extension candidates. Maximal degree in co-relation 612. Up to 103 conditions per place. [2021-06-11 16:05:45,657 INFO L151 LiptonReduction]: Number of co-enabled transitions 324 [2021-06-11 16:05:45,660 INFO L163 LiptonReduction]: Checked pairs total: 75 [2021-06-11 16:05:45,661 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:45,661 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-06-11 16:05:45,661 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 206 flow [2021-06-11 16:05:45,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,662 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:45,662 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:45,662 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-11 16:05:45,662 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:45,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:45,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1774949271, now seen corresponding path program 3 times [2021-06-11 16:05:45,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:45,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652867929] [2021-06-11 16:05:45,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:45,717 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-06-11 16:05:45,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:45,727 INFO L142 QuantifierPusher]: treesize reduction 30, result has 34.8 percent of original size [2021-06-11 16:05:45,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:05:45,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:45,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:45,746 INFO L142 QuantifierPusher]: treesize reduction 19, result has 75.9 percent of original size [2021-06-11 16:05:45,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-06-11 16:05:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:45,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652867929] [2021-06-11 16:05:45,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:45,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:05:45,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41331095] [2021-06-11 16:05:45,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:05:45,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:45,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:05:45,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:05:45,768 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 186 [2021-06-11 16:05:45,768 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 138.83333333333334) internal successors, (833), 6 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:45,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 186 [2021-06-11 16:05:45,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:45,854 INFO L129 PetriNetUnfolder]: 81/185 cut-off events. [2021-06-11 16:05:45,855 INFO L130 PetriNetUnfolder]: For 417/530 co-relation queries the response was YES. [2021-06-11 16:05:45,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 185 events. 81/185 cut-off events. For 417/530 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 809 event pairs, 27 based on Foata normal form. 14/185 useless extension candidates. Maximal degree in co-relation 735. Up to 125 conditions per place. [2021-06-11 16:05:45,856 INFO L132 encePairwiseOnDemand]: 179/186 looper letters, 15 selfloop transitions, 13 changer transitions 0/43 dead transitions. [2021-06-11 16:05:45,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 307 flow [2021-06-11 16:05:45,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:05:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:05:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2021-06-11 16:05:45,858 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7612903225806451 [2021-06-11 16:05:45,858 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2021-06-11 16:05:45,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2021-06-11 16:05:45,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:45,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2021-06-11 16:05:45,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,861 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,861 INFO L185 Difference]: Start difference. First operand has 44 places, 37 transitions, 206 flow. Second operand 5 states and 708 transitions. [2021-06-11 16:05:45,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 307 flow [2021-06-11 16:05:45,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 278 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-06-11 16:05:45,863 INFO L241 Difference]: Finished difference. Result has 47 places, 42 transitions, 258 flow [2021-06-11 16:05:45,863 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2021-06-11 16:05:45,863 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2021-06-11 16:05:45,864 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:45,864 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 258 flow [2021-06-11 16:05:45,864 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 258 flow [2021-06-11 16:05:45,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 258 flow [2021-06-11 16:05:45,882 INFO L129 PetriNetUnfolder]: 76/175 cut-off events. [2021-06-11 16:05:45,882 INFO L130 PetriNetUnfolder]: For 659/711 co-relation queries the response was YES. [2021-06-11 16:05:45,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 175 events. 76/175 cut-off events. For 659/711 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 765 event pairs, 17 based on Foata normal form. 4/156 useless extension candidates. Maximal degree in co-relation 671. Up to 92 conditions per place. [2021-06-11 16:05:45,883 INFO L151 LiptonReduction]: Number of co-enabled transitions 330 [2021-06-11 16:05:45,889 INFO L163 LiptonReduction]: Checked pairs total: 75 [2021-06-11 16:05:45,889 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:45,889 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-06-11 16:05:45,889 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 258 flow [2021-06-11 16:05:45,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 138.83333333333334) internal successors, (833), 6 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,890 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:45,890 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:45,890 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-11 16:05:45,890 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:45,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:45,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1507419066, now seen corresponding path program 1 times [2021-06-11 16:05:45,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:45,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821223068] [2021-06-11 16:05:45,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:45,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:45,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:45,934 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 16:05:45,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:45,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:45,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:45,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821223068] [2021-06-11 16:05:45,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:45,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:05:45,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320928097] [2021-06-11 16:05:45,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:05:45,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:45,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:05:45,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:05:45,941 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 186 [2021-06-11 16:05:45,941 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:45,941 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:45,941 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 186 [2021-06-11 16:05:45,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:45,995 INFO L129 PetriNetUnfolder]: 152/331 cut-off events. [2021-06-11 16:05:45,995 INFO L130 PetriNetUnfolder]: For 667/755 co-relation queries the response was YES. [2021-06-11 16:05:45,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 331 events. 152/331 cut-off events. For 667/755 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1763 event pairs, 49 based on Foata normal form. 51/329 useless extension candidates. Maximal degree in co-relation 1053. Up to 115 conditions per place. [2021-06-11 16:05:45,997 INFO L132 encePairwiseOnDemand]: 179/186 looper letters, 8 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2021-06-11 16:05:45,997 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 256 flow [2021-06-11 16:05:45,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:05:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:05:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 750 transitions. [2021-06-11 16:05:45,999 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8064516129032258 [2021-06-11 16:05:46,000 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 750 transitions. [2021-06-11 16:05:46,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 750 transitions. [2021-06-11 16:05:46,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:46,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 750 transitions. [2021-06-11 16:05:46,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.0) internal successors, (750), 5 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,003 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,003 INFO L185 Difference]: Start difference. First operand has 47 places, 42 transitions, 258 flow. Second operand 5 states and 750 transitions. [2021-06-11 16:05:46,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 256 flow [2021-06-11 16:05:46,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 235 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-06-11 16:05:46,006 INFO L241 Difference]: Finished difference. Result has 50 places, 43 transitions, 246 flow [2021-06-11 16:05:46,006 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2021-06-11 16:05:46,007 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2021-06-11 16:05:46,007 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:46,007 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 43 transitions, 246 flow [2021-06-11 16:05:46,007 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 43 transitions, 246 flow [2021-06-11 16:05:46,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 43 transitions, 246 flow [2021-06-11 16:05:46,034 INFO L129 PetriNetUnfolder]: 148/326 cut-off events. [2021-06-11 16:05:46,034 INFO L130 PetriNetUnfolder]: For 650/741 co-relation queries the response was YES. [2021-06-11 16:05:46,035 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 326 events. 148/326 cut-off events. For 650/741 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 1802 event pairs, 49 based on Foata normal form. 11/294 useless extension candidates. Maximal degree in co-relation 1146. Up to 133 conditions per place. [2021-06-11 16:05:46,037 INFO L151 LiptonReduction]: Number of co-enabled transitions 428 [2021-06-11 16:05:46,040 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:05:46,040 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:46,040 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-06-11 16:05:46,040 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 246 flow [2021-06-11 16:05:46,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,041 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:46,041 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:46,041 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-11 16:05:46,041 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:46,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:46,041 INFO L82 PathProgramCache]: Analyzing trace with hash -548701598, now seen corresponding path program 1 times [2021-06-11 16:05:46,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:46,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789780697] [2021-06-11 16:05:46,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:46,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:46,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:46,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:46,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:46,096 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 16:05:46,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:46,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:46,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:46,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789780697] [2021-06-11 16:05:46,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:46,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:05:46,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051096318] [2021-06-11 16:05:46,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:05:46,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:46,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:05:46,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:05:46,107 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 186 [2021-06-11 16:05:46,108 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,108 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:46,108 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 186 [2021-06-11 16:05:46,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:46,170 INFO L129 PetriNetUnfolder]: 88/231 cut-off events. [2021-06-11 16:05:46,171 INFO L130 PetriNetUnfolder]: For 612/1011 co-relation queries the response was YES. [2021-06-11 16:05:46,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 231 events. 88/231 cut-off events. For 612/1011 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1202 event pairs, 8 based on Foata normal form. 110/316 useless extension candidates. Maximal degree in co-relation 863. Up to 109 conditions per place. [2021-06-11 16:05:46,172 INFO L132 encePairwiseOnDemand]: 179/186 looper letters, 5 selfloop transitions, 18 changer transitions 3/54 dead transitions. [2021-06-11 16:05:46,172 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 361 flow [2021-06-11 16:05:46,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 16:05:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 16:05:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1050 transitions. [2021-06-11 16:05:46,175 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8064516129032258 [2021-06-11 16:05:46,175 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1050 transitions. [2021-06-11 16:05:46,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1050 transitions. [2021-06-11 16:05:46,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:46,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1050 transitions. [2021-06-11 16:05:46,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 150.0) internal successors, (1050), 7 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 186.0) internal successors, (1488), 8 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,179 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 186.0) internal successors, (1488), 8 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,179 INFO L185 Difference]: Start difference. First operand has 50 places, 43 transitions, 246 flow. Second operand 7 states and 1050 transitions. [2021-06-11 16:05:46,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 361 flow [2021-06-11 16:05:46,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 361 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 16:05:46,181 INFO L241 Difference]: Finished difference. Result has 59 places, 51 transitions, 359 flow [2021-06-11 16:05:46,181 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=359, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2021-06-11 16:05:46,182 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2021-06-11 16:05:46,182 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:46,182 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 51 transitions, 359 flow [2021-06-11 16:05:46,182 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 51 transitions, 359 flow [2021-06-11 16:05:46,182 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 51 transitions, 359 flow [2021-06-11 16:05:46,199 INFO L129 PetriNetUnfolder]: 81/223 cut-off events. [2021-06-11 16:05:46,199 INFO L130 PetriNetUnfolder]: For 827/940 co-relation queries the response was YES. [2021-06-11 16:05:46,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 223 events. 81/223 cut-off events. For 827/940 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1206 event pairs, 8 based on Foata normal form. 8/209 useless extension candidates. Maximal degree in co-relation 922. Up to 100 conditions per place. [2021-06-11 16:05:46,201 INFO L151 LiptonReduction]: Number of co-enabled transitions 476 [2021-06-11 16:05:46,204 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:05:46,204 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:46,204 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-06-11 16:05:46,205 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 359 flow [2021-06-11 16:05:46,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,205 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:46,205 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:46,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-11 16:05:46,205 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:46,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:46,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1789027315, now seen corresponding path program 1 times [2021-06-11 16:05:46,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:46,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693716169] [2021-06-11 16:05:46,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:46,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:46,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:46,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:46,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:46,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693716169] [2021-06-11 16:05:46,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:46,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:05:46,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807147421] [2021-06-11 16:05:46,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:05:46,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:46,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:05:46,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:05:46,236 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 186 [2021-06-11 16:05:46,237 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 359 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,237 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:46,237 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 186 [2021-06-11 16:05:46,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:46,272 INFO L129 PetriNetUnfolder]: 131/349 cut-off events. [2021-06-11 16:05:46,272 INFO L130 PetriNetUnfolder]: For 1495/1716 co-relation queries the response was YES. [2021-06-11 16:05:46,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 349 events. 131/349 cut-off events. For 1495/1716 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2073 event pairs, 12 based on Foata normal form. 22/336 useless extension candidates. Maximal degree in co-relation 1480. Up to 170 conditions per place. [2021-06-11 16:05:46,275 INFO L132 encePairwiseOnDemand]: 183/186 looper letters, 3 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2021-06-11 16:05:46,275 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 371 flow [2021-06-11 16:05:46,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:05:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:05:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2021-06-11 16:05:46,276 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8548387096774194 [2021-06-11 16:05:46,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2021-06-11 16:05:46,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2021-06-11 16:05:46,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:46,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2021-06-11 16:05:46,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,279 INFO L185 Difference]: Start difference. First operand has 59 places, 51 transitions, 359 flow. Second operand 3 states and 477 transitions. [2021-06-11 16:05:46,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 371 flow [2021-06-11 16:05:46,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 51 transitions, 328 flow, removed 13 selfloop flow, removed 3 redundant places. [2021-06-11 16:05:46,285 INFO L241 Difference]: Finished difference. Result has 59 places, 51 transitions, 327 flow [2021-06-11 16:05:46,285 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2021-06-11 16:05:46,286 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2021-06-11 16:05:46,286 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:46,286 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 51 transitions, 327 flow [2021-06-11 16:05:46,286 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 51 transitions, 327 flow [2021-06-11 16:05:46,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 51 transitions, 327 flow [2021-06-11 16:05:46,310 INFO L129 PetriNetUnfolder]: 131/350 cut-off events. [2021-06-11 16:05:46,310 INFO L130 PetriNetUnfolder]: For 922/965 co-relation queries the response was YES. [2021-06-11 16:05:46,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 350 events. 131/350 cut-off events. For 922/965 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2170 event pairs, 10 based on Foata normal form. 11/325 useless extension candidates. Maximal degree in co-relation 1255. Up to 89 conditions per place. [2021-06-11 16:05:46,313 INFO L151 LiptonReduction]: Number of co-enabled transitions 476 [2021-06-11 16:05:46,317 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:05:46,317 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:46,317 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-06-11 16:05:46,319 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 327 flow [2021-06-11 16:05:46,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,320 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:46,320 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:46,320 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-11 16:05:46,320 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:46,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:46,320 INFO L82 PathProgramCache]: Analyzing trace with hash 219732787, now seen corresponding path program 1 times [2021-06-11 16:05:46,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:46,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873461313] [2021-06-11 16:05:46,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:46,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:46,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:46,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:46,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:46,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:46,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:46,401 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 16:05:46,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:46,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:46,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:46,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873461313] [2021-06-11 16:05:46,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:46,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 16:05:46,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262726416] [2021-06-11 16:05:46,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:05:46,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:46,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:05:46,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:05:46,410 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 186 [2021-06-11 16:05:46,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:46,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 186 [2021-06-11 16:05:46,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:46,508 INFO L129 PetriNetUnfolder]: 113/308 cut-off events. [2021-06-11 16:05:46,509 INFO L130 PetriNetUnfolder]: For 1185/1747 co-relation queries the response was YES. [2021-06-11 16:05:46,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1283 conditions, 308 events. 113/308 cut-off events. For 1185/1747 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 1823 event pairs, 2 based on Foata normal form. 164/438 useless extension candidates. Maximal degree in co-relation 1256. Up to 96 conditions per place. [2021-06-11 16:05:46,511 INFO L132 encePairwiseOnDemand]: 179/186 looper letters, 2 selfloop transitions, 22 changer transitions 10/56 dead transitions. [2021-06-11 16:05:46,511 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 56 transitions, 420 flow [2021-06-11 16:05:46,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 16:05:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 16:05:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1344 transitions. [2021-06-11 16:05:46,513 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8028673835125448 [2021-06-11 16:05:46,513 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1344 transitions. [2021-06-11 16:05:46,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1344 transitions. [2021-06-11 16:05:46,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:46,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1344 transitions. [2021-06-11 16:05:46,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.33333333333334) internal successors, (1344), 9 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 186.0) internal successors, (1860), 10 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,518 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 186.0) internal successors, (1860), 10 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,518 INFO L185 Difference]: Start difference. First operand has 59 places, 51 transitions, 327 flow. Second operand 9 states and 1344 transitions. [2021-06-11 16:05:46,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 56 transitions, 420 flow [2021-06-11 16:05:46,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 56 transitions, 403 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-06-11 16:05:46,525 INFO L241 Difference]: Finished difference. Result has 68 places, 46 transitions, 344 flow [2021-06-11 16:05:46,525 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=344, PETRI_PLACES=68, PETRI_TRANSITIONS=46} [2021-06-11 16:05:46,525 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 31 predicate places. [2021-06-11 16:05:46,525 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:46,525 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 46 transitions, 344 flow [2021-06-11 16:05:46,525 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 46 transitions, 344 flow [2021-06-11 16:05:46,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 46 transitions, 344 flow [2021-06-11 16:05:46,544 INFO L129 PetriNetUnfolder]: 105/289 cut-off events. [2021-06-11 16:05:46,544 INFO L130 PetriNetUnfolder]: For 1181/1308 co-relation queries the response was YES. [2021-06-11 16:05:46,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 289 events. 105/289 cut-off events. For 1181/1308 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 1922 event pairs, 2 based on Foata normal form. 5/253 useless extension candidates. Maximal degree in co-relation 1208. Up to 96 conditions per place. [2021-06-11 16:05:46,547 INFO L151 LiptonReduction]: Number of co-enabled transitions 388 [2021-06-11 16:05:46,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:46,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:46,592 INFO L163 LiptonReduction]: Checked pairs total: 44 [2021-06-11 16:05:46,592 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 16:05:46,592 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 67 [2021-06-11 16:05:46,592 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 343 flow [2021-06-11 16:05:46,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:46,593 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:46,593 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-06-11 16:05:46,593 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-11 16:05:46,593 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:46,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:46,593 INFO L82 PathProgramCache]: Analyzing trace with hash 826927050, now seen corresponding path program 1 times [2021-06-11 16:05:46,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:46,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419273527] [2021-06-11 16:05:46,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:05:46,631 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:05:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:05:46,673 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:05:46,708 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 16:05:46,708 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 16:05:46,708 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-11 16:05:46,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 04:05:46 BasicIcfg [2021-06-11 16:05:46,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 16:05:46,778 INFO L168 Benchmark]: Toolchain (without parser) took 16569.97 ms. Allocated memory was 346.0 MB in the beginning and 698.4 MB in the end (delta: 352.3 MB). Free memory was 308.0 MB in the beginning and 572.9 MB in the end (delta: -264.9 MB). Peak memory consumption was 86.3 MB. Max. memory is 16.0 GB. [2021-06-11 16:05:46,778 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 346.0 MB. Free memory is still 326.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 16:05:46,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 495.56 ms. Allocated memory is still 346.0 MB. Free memory was 307.8 MB in the beginning and 304.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.0 GB. [2021-06-11 16:05:46,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.58 ms. Allocated memory is still 346.0 MB. Free memory was 304.3 MB in the beginning and 300.6 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-11 16:05:46,778 INFO L168 Benchmark]: Boogie Preprocessor took 21.81 ms. Allocated memory is still 346.0 MB. Free memory was 300.6 MB in the beginning and 299.1 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 16:05:46,778 INFO L168 Benchmark]: RCFGBuilder took 1557.47 ms. Allocated memory is still 346.0 MB. Free memory was 299.1 MB in the beginning and 232.5 MB in the end (delta: 66.5 MB). Peak memory consumption was 138.4 MB. Max. memory is 16.0 GB. [2021-06-11 16:05:46,778 INFO L168 Benchmark]: TraceAbstraction took 14441.58 ms. Allocated memory was 346.0 MB in the beginning and 698.4 MB in the end (delta: 352.3 MB). Free memory was 231.5 MB in the beginning and 572.9 MB in the end (delta: -341.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.0 GB. [2021-06-11 16:05:46,779 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.12 ms. Allocated memory is still 346.0 MB. Free memory is still 326.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 495.56 ms. Allocated memory is still 346.0 MB. Free memory was 307.8 MB in the beginning and 304.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 43.58 ms. Allocated memory is still 346.0 MB. Free memory was 304.3 MB in the beginning and 300.6 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 21.81 ms. Allocated memory is still 346.0 MB. Free memory was 300.6 MB in the beginning and 299.1 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 1557.47 ms. Allocated memory is still 346.0 MB. Free memory was 299.1 MB in the beginning and 232.5 MB in the end (delta: 66.5 MB). Peak memory consumption was 138.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 14441.58 ms. Allocated memory was 346.0 MB in the beginning and 698.4 MB in the end (delta: 352.3 MB). Free memory was 231.5 MB in the beginning and 572.9 MB in the end (delta: -341.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4766.3ms, 102 PlacesBefore, 37 PlacesAfterwards, 94 TransitionsBefore, 28 TransitionsAfterwards, 1686 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, 4853 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1860, positive: 1705, positive conditional: 1705, positive unconditional: 0, negative: 155, negative conditional: 155, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1860, positive: 1705, positive conditional: 0, positive unconditional: 1705, negative: 155, negative conditional: 0, negative unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1860, positive: 1705, positive conditional: 0, positive unconditional: 1705, negative: 155, negative conditional: 0, negative unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1233, positive: 1193, positive conditional: 0, positive unconditional: 1193, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1233, positive: 1170, positive conditional: 0, positive unconditional: 1170, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 492, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 433, negative conditional: 0, negative unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1860, positive: 512, positive conditional: 0, positive unconditional: 512, negative: 115, negative conditional: 0, negative unconditional: 115, unknown: 1233, unknown conditional: 0, unknown unconditional: 1233] , Statistics on independence cache: Total cache size (in pairs): 1233, Positive cache size: 1193, Positive conditional cache size: 0, Positive unconditional cache size: 1193, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6993.3ms, 34 PlacesBefore, 33 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 684 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, positive: 120, positive conditional: 2, positive unconditional: 118, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, positive: 120, positive conditional: 2, positive unconditional: 118, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, positive: 32, positive conditional: 1, positive unconditional: 31, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 320, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 164, positive: 88, positive conditional: 1, positive unconditional: 87, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 41, unknown conditional: 1, unknown unconditional: 40] , Statistics on independence cache: Total cache size (in pairs): 1274, Positive cache size: 1225, Positive conditional cache size: 1, Positive unconditional cache size: 1224, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.8ms, 37 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 250 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 1285, Positive cache size: 1235, Positive conditional cache size: 1, Positive unconditional cache size: 1234, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9ms, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 226 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1287, Positive cache size: 1237, Positive conditional cache size: 1, Positive unconditional cache size: 1236, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 123.1ms, 37 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 327 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 1297, Positive cache size: 1246, Positive conditional cache size: 1, Positive unconditional cache size: 1245, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4ms, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 78 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 11, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1297, Positive cache size: 1246, Positive conditional cache size: 1, Positive unconditional cache size: 1245, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 202.1ms, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 60 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, positive: 18, positive conditional: 9, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 18, positive conditional: 9, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 9, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 186, positive: 135, positive conditional: 135, positive unconditional: 0, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 15, unknown conditional: 9, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1312, Positive cache size: 1259, Positive conditional cache size: 10, Positive unconditional cache size: 1249, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.0ms, 44 PlacesBefore, 44 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 75 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, positive: 30, positive conditional: 12, positive unconditional: 18, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 30, positive conditional: 12, positive unconditional: 18, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 33, positive: 29, positive conditional: 12, positive unconditional: 17, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1313, Positive cache size: 1260, Positive conditional cache size: 10, Positive unconditional cache size: 1250, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.1ms, 47 PlacesBefore, 47 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 75 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, positive: 24, positive conditional: 15, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, positive: 24, positive conditional: 15, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, positive: 22, positive conditional: 13, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1315, Positive cache size: 1262, Positive conditional cache size: 12, Positive unconditional cache size: 1250, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.9ms, 50 PlacesBefore, 50 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1315, Positive cache size: 1262, Positive conditional cache size: 12, Positive unconditional cache size: 1250, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.1ms, 59 PlacesBefore, 59 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 476 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1315, Positive cache size: 1262, Positive conditional cache size: 12, Positive unconditional cache size: 1250, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.4ms, 59 PlacesBefore, 59 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 476 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1315, Positive cache size: 1262, Positive conditional cache size: 12, Positive unconditional cache size: 1250, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.6ms, 68 PlacesBefore, 64 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 44 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 44, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1316, Positive cache size: 1263, Positive conditional cache size: 12, Positive unconditional cache size: 1251, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Eliminated conditions: 44 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2034; [L819] FCALL, FORK 0 pthread_create(&t2034, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2035; [L821] FCALL, FORK 0 pthread_create(&t2035, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] 0 pthread_t t2036; [L823] FCALL, FORK 0 pthread_create(&t2036, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 14277.2ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 816.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4834.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 49 SDtfs, 33 SDslu, 17 SDs, 0 SdLazy, 259 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 233.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 185.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=359occurred in iteration=10, InterpolantAutomatonStates: 57, 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: 29.7ms SsaConstructionTime, 294.3ms SatisfiabilityAnalysisTime, 517.2ms InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...