/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:14:29,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:14:29,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:14:29,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:14:29,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:14:29,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:14:29,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:14:29,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:14:29,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:14:29,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:14:29,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:14:29,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:14:29,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:14:29,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:14:29,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:14:29,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:14:29,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:14:29,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:14:29,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:14:29,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:14:29,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:14:29,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:14:29,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:14:29,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:14:29,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:14:29,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:14:29,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:14:29,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:14:29,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:14:29,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:14:29,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:14:29,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:14:29,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:14:29,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:14:29,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:14:29,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:14:29,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:14:29,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:14:29,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:14:29,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:14:29,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:14:29,604 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:14:29,631 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:14:29,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:14:29,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:14:29,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:14:29,633 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:14:29,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:14:29,633 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:14:29,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:14:29,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:14:29,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:14:29,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:14:29,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:14:29,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:14:29,635 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:14:29,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:14:29,637 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:14:29,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:14:29,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:14:29,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:14:29,638 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:14:29,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:14:29,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:14:29,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:14:29,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:14:29,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:14:29,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:14:29,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:14:29,639 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:14:29,640 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:14:29,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:14:29,640 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:14:29,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:14:29,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:14:30,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:14:30,001 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:14:30,001 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:14:30,003 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_rmo.oepc.i [2021-03-26 00:14:30,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf06a97b/1f9c296ce25e477bbb92501754be53a1/FLAG44bd8f4d0 [2021-03-26 00:14:30,616 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:14:30,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_rmo.oepc.i [2021-03-26 00:14:30,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf06a97b/1f9c296ce25e477bbb92501754be53a1/FLAG44bd8f4d0 [2021-03-26 00:14:30,914 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf06a97b/1f9c296ce25e477bbb92501754be53a1 [2021-03-26 00:14:30,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:14:30,917 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:14:30,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:14:30,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:14:30,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:14:30,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:14:30" (1/1) ... [2021-03-26 00:14:30,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b9ea07e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:30, skipping insertion in model container [2021-03-26 00:14:30,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:14:30" (1/1) ... [2021-03-26 00:14:30,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:14:30,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:14:31,126 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/mix032_rmo.oepc.i[949,962] [2021-03-26 00:14:31,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:14:31,356 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:14:31,366 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/mix032_rmo.oepc.i[949,962] [2021-03-26 00:14:31,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:14:31,461 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:14:31,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:31 WrapperNode [2021-03-26 00:14:31,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:14:31,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:14:31,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:14:31,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:14:31,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:31" (1/1) ... [2021-03-26 00:14:31,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:31" (1/1) ... [2021-03-26 00:14:31,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:14:31,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:14:31,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:14:31,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:14:31,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:31" (1/1) ... [2021-03-26 00:14:31,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:31" (1/1) ... [2021-03-26 00:14:31,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:31" (1/1) ... [2021-03-26 00:14:31,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:31" (1/1) ... [2021-03-26 00:14:31,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:31" (1/1) ... [2021-03-26 00:14:31,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:31" (1/1) ... [2021-03-26 00:14:31,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:31" (1/1) ... [2021-03-26 00:14:31,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:14:31,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:14:31,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:14:31,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:14:31,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:14:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:14:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:14:31,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:14:31,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:14:31,659 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:14:31,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:14:31,660 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:14:31,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:14:31,661 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:14:31,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:14:31,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:14:31,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:14:31,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:14:31,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:14:31,662 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:14:33,453 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:14:33,453 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:14:33,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:14:33 BoogieIcfgContainer [2021-03-26 00:14:33,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:14:33,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:14:33,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:14:33,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:14:33,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:14:30" (1/3) ... [2021-03-26 00:14:33,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e04fbb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:14:33, skipping insertion in model container [2021-03-26 00:14:33,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:14:31" (2/3) ... [2021-03-26 00:14:33,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e04fbb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:14:33, skipping insertion in model container [2021-03-26 00:14:33,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:14:33" (3/3) ... [2021-03-26 00:14:33,463 INFO L111 eAbstractionObserver]: Analyzing ICFG mix032_rmo.oepc.i [2021-03-26 00:14:33,468 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:14:33,472 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:14:33,472 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:14:33,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,512 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,512 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,512 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,513 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,513 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,513 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,513 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,513 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,518 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,518 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,519 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,519 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,522 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,522 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,523 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,523 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,550 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,550 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,551 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,553 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,553 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,556 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,557 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:14:33,560 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:14:33,576 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:14:33,600 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:14:33,601 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:14:33,601 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:14:33,601 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:14:33,601 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:14:33,601 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:14:33,602 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:14:33,605 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:14:33,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2021-03-26 00:14:33,661 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2021-03-26 00:14:33,661 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:14:33,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2021-03-26 00:14:33,676 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2021-03-26 00:14:33,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2021-03-26 00:14:33,682 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:33,692 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2021-03-26 00:14:33,695 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2021-03-26 00:14:33,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2021-03-26 00:14:33,729 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2021-03-26 00:14:33,729 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:14:33,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2021-03-26 00:14:33,735 INFO L142 LiptonReduction]: Number of co-enabled transitions 2054 [2021-03-26 00:14:35,062 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:14:35,440 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:14:35,571 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:14:36,651 INFO L154 LiptonReduction]: Checked pairs total: 3242 [2021-03-26 00:14:36,652 INFO L156 LiptonReduction]: Total number of compositions: 68 [2021-03-26 00:14:36,658 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2977 [2021-03-26 00:14:36,668 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 00:14:36,668 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:14:36,669 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:36,669 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:36,669 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:36,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:36,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1120472696, now seen corresponding path program 1 times [2021-03-26 00:14:36,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:36,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474064437] [2021-03-26 00:14:36,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:36,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:36,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:36,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:36,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:36,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474064437] [2021-03-26 00:14:36,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:36,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:14:36,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361644319] [2021-03-26 00:14:36,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:14:36,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:36,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:14:36,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:14:36,962 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 175 [2021-03-26 00:14:36,966 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:36,966 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:36,966 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 175 [2021-03-26 00:14:36,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:37,056 INFO L129 PetriNetUnfolder]: 49/145 cut-off events. [2021-03-26 00:14:37,057 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:14:37,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 145 events. 49/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 591 event pairs, 38 based on Foata normal form. 17/155 useless extension candidates. Maximal degree in co-relation 220. Up to 65 conditions per place. [2021-03-26 00:14:37,060 INFO L132 encePairwiseOnDemand]: 171/175 looper letters, 9 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2021-03-26 00:14:37,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 119 flow [2021-03-26 00:14:37,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:14:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:14:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2021-03-26 00:14:37,078 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9123809523809524 [2021-03-26 00:14:37,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2021-03-26 00:14:37,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2021-03-26 00:14:37,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:37,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2021-03-26 00:14:37,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:37,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:37,104 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:37,106 INFO L185 Difference]: Start difference. First operand has 52 places, 43 transitions, 95 flow. Second operand 3 states and 479 transitions. [2021-03-26 00:14:37,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 119 flow [2021-03-26 00:14:37,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 116 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:14:37,110 INFO L241 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2021-03-26 00:14:37,112 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2021-03-26 00:14:37,113 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2021-03-26 00:14:37,113 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:37,113 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 40 transitions, 90 flow [2021-03-26 00:14:37,114 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 40 transitions, 90 flow [2021-03-26 00:14:37,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 90 flow [2021-03-26 00:14:37,123 INFO L129 PetriNetUnfolder]: 0/40 cut-off events. [2021-03-26 00:14:37,123 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:14:37,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:14:37,124 INFO L142 LiptonReduction]: Number of co-enabled transitions 434 [2021-03-26 00:14:37,779 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:14:37,932 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:14:38,689 INFO L154 LiptonReduction]: Checked pairs total: 1436 [2021-03-26 00:14:38,690 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-26 00:14:38,690 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1577 [2021-03-26 00:14:38,692 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 64 flow [2021-03-26 00:14:38,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:38,692 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:38,693 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:38,693 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:14:38,693 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:38,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash 579587855, now seen corresponding path program 1 times [2021-03-26 00:14:38,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:38,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985016036] [2021-03-26 00:14:38,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:38,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:38,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:38,827 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:14:38,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:14:38,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:38,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:14:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:38,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985016036] [2021-03-26 00:14:38,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:38,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:14:38,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982139056] [2021-03-26 00:14:38,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:14:38,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:38,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:14:38,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:14:38,859 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 188 [2021-03-26 00:14:38,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:38,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:38,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 188 [2021-03-26 00:14:38,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:38,944 INFO L129 PetriNetUnfolder]: 92/233 cut-off events. [2021-03-26 00:14:38,944 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:14:38,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 233 events. 92/233 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1165 event pairs, 26 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 394. Up to 81 conditions per place. [2021-03-26 00:14:38,946 INFO L132 encePairwiseOnDemand]: 180/188 looper letters, 6 selfloop transitions, 4 changer transitions 12/41 dead transitions. [2021-03-26 00:14:38,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 136 flow [2021-03-26 00:14:38,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:14:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:14:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 773 transitions. [2021-03-26 00:14:38,949 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8223404255319149 [2021-03-26 00:14:38,949 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 773 transitions. [2021-03-26 00:14:38,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 773 transitions. [2021-03-26 00:14:38,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:38,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 773 transitions. [2021-03-26 00:14:38,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.6) internal successors, (773), 5 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:38,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:38,954 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:38,955 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 64 flow. Second operand 5 states and 773 transitions. [2021-03-26 00:14:38,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 136 flow [2021-03-26 00:14:38,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:14:38,956 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 94 flow [2021-03-26 00:14:38,956 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-03-26 00:14:38,957 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -12 predicate places. [2021-03-26 00:14:38,957 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:38,957 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 94 flow [2021-03-26 00:14:38,957 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 94 flow [2021-03-26 00:14:38,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 94 flow [2021-03-26 00:14:38,973 INFO L129 PetriNetUnfolder]: 39/125 cut-off events. [2021-03-26 00:14:38,973 INFO L130 PetriNetUnfolder]: For 28/29 co-relation queries the response was YES. [2021-03-26 00:14:38,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 125 events. 39/125 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 537 event pairs, 27 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 234. Up to 59 conditions per place. [2021-03-26 00:14:38,975 INFO L142 LiptonReduction]: Number of co-enabled transitions 276 [2021-03-26 00:14:39,835 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 00:14:40,009 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:14:40,365 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 00:14:40,512 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:14:40,518 INFO L154 LiptonReduction]: Checked pairs total: 576 [2021-03-26 00:14:40,518 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:14:40,518 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1561 [2021-03-26 00:14:40,519 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 88 flow [2021-03-26 00:14:40,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,520 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:40,520 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:40,520 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:14:40,520 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:40,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:40,521 INFO L82 PathProgramCache]: Analyzing trace with hash -957657112, now seen corresponding path program 1 times [2021-03-26 00:14:40,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:40,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40820572] [2021-03-26 00:14:40,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:40,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:40,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:40,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40820572] [2021-03-26 00:14:40,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:40,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:14:40,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162844853] [2021-03-26 00:14:40,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:14:40,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:40,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:14:40,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:14:40,597 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 191 [2021-03-26 00:14:40,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:40,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 191 [2021-03-26 00:14:40,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:40,616 INFO L129 PetriNetUnfolder]: 26/94 cut-off events. [2021-03-26 00:14:40,616 INFO L130 PetriNetUnfolder]: For 41/48 co-relation queries the response was YES. [2021-03-26 00:14:40,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 94 events. 26/94 cut-off events. For 41/48 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 357 event pairs, 7 based on Foata normal form. 3/88 useless extension candidates. Maximal degree in co-relation 193. Up to 47 conditions per place. [2021-03-26 00:14:40,617 INFO L132 encePairwiseOnDemand]: 188/191 looper letters, 1 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-26 00:14:40,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 96 flow [2021-03-26 00:14:40,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:14:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:14:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2021-03-26 00:14:40,619 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8970331588132635 [2021-03-26 00:14:40,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 514 transitions. [2021-03-26 00:14:40,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 514 transitions. [2021-03-26 00:14:40,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:40,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 514 transitions. [2021-03-26 00:14:40,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,623 INFO L185 Difference]: Start difference. First operand has 34 places, 26 transitions, 88 flow. Second operand 3 states and 514 transitions. [2021-03-26 00:14:40,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 96 flow [2021-03-26 00:14:40,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 92 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:14:40,624 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 95 flow [2021-03-26 00:14:40,624 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2021-03-26 00:14:40,624 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -16 predicate places. [2021-03-26 00:14:40,625 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:40,625 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 95 flow [2021-03-26 00:14:40,625 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 95 flow [2021-03-26 00:14:40,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 95 flow [2021-03-26 00:14:40,635 INFO L129 PetriNetUnfolder]: 28/102 cut-off events. [2021-03-26 00:14:40,635 INFO L130 PetriNetUnfolder]: For 40/47 co-relation queries the response was YES. [2021-03-26 00:14:40,635 INFO L84 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 102 events. 28/102 cut-off events. For 40/47 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 419 event pairs, 14 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 207. Up to 48 conditions per place. [2021-03-26 00:14:40,637 INFO L142 LiptonReduction]: Number of co-enabled transitions 274 [2021-03-26 00:14:40,639 INFO L154 LiptonReduction]: Checked pairs total: 191 [2021-03-26 00:14:40,639 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:14:40,639 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-03-26 00:14:40,641 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 95 flow [2021-03-26 00:14:40,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,641 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:40,641 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:40,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:14:40,641 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:40,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:40,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1235538674, now seen corresponding path program 1 times [2021-03-26 00:14:40,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:40,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664209549] [2021-03-26 00:14:40,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:40,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:40,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:40,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664209549] [2021-03-26 00:14:40,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:40,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:14:40,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735360587] [2021-03-26 00:14:40,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:14:40,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:40,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:14:40,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:14:40,678 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 191 [2021-03-26 00:14:40,679 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,679 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:40,679 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 191 [2021-03-26 00:14:40,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:40,694 INFO L129 PetriNetUnfolder]: 19/80 cut-off events. [2021-03-26 00:14:40,694 INFO L130 PetriNetUnfolder]: For 52/57 co-relation queries the response was YES. [2021-03-26 00:14:40,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 80 events. 19/80 cut-off events. For 52/57 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 279 event pairs, 8 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 167. Up to 37 conditions per place. [2021-03-26 00:14:40,695 INFO L132 encePairwiseOnDemand]: 188/191 looper letters, 1 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-26 00:14:40,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 26 transitions, 103 flow [2021-03-26 00:14:40,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:14:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:14:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2021-03-26 00:14:40,702 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8865619546247818 [2021-03-26 00:14:40,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2021-03-26 00:14:40,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2021-03-26 00:14:40,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:40,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2021-03-26 00:14:40,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,706 INFO L185 Difference]: Start difference. First operand has 36 places, 26 transitions, 95 flow. Second operand 3 states and 508 transitions. [2021-03-26 00:14:40,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 26 transitions, 103 flow [2021-03-26 00:14:40,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 97 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:14:40,709 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 100 flow [2021-03-26 00:14:40,709 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=89, 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=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2021-03-26 00:14:40,709 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -15 predicate places. [2021-03-26 00:14:40,710 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:40,710 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 100 flow [2021-03-26 00:14:40,710 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 100 flow [2021-03-26 00:14:40,710 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 100 flow [2021-03-26 00:14:40,719 INFO L129 PetriNetUnfolder]: 19/80 cut-off events. [2021-03-26 00:14:40,720 INFO L130 PetriNetUnfolder]: For 32/38 co-relation queries the response was YES. [2021-03-26 00:14:40,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 80 events. 19/80 cut-off events. For 32/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 300 event pairs, 8 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 167. Up to 37 conditions per place. [2021-03-26 00:14:40,721 INFO L142 LiptonReduction]: Number of co-enabled transitions 272 [2021-03-26 00:14:40,748 INFO L154 LiptonReduction]: Checked pairs total: 220 [2021-03-26 00:14:40,748 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:14:40,748 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-26 00:14:40,754 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 100 flow [2021-03-26 00:14:40,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,754 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:40,755 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:40,755 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:14:40,755 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:40,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:40,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1955932165, now seen corresponding path program 1 times [2021-03-26 00:14:40,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:40,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472756600] [2021-03-26 00:14:40,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:40,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:40,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:40,847 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:14:40,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:14:40,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:40,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:40,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472756600] [2021-03-26 00:14:40,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:40,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:14:40,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483593640] [2021-03-26 00:14:40,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:14:40,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:40,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:14:40,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:14:40,857 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 191 [2021-03-26 00:14:40,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:40,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 191 [2021-03-26 00:14:40,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:40,901 INFO L129 PetriNetUnfolder]: 73/201 cut-off events. [2021-03-26 00:14:40,901 INFO L130 PetriNetUnfolder]: For 61/65 co-relation queries the response was YES. [2021-03-26 00:14:40,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 201 events. 73/201 cut-off events. For 61/65 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1023 event pairs, 27 based on Foata normal form. 21/209 useless extension candidates. Maximal degree in co-relation 445. Up to 104 conditions per place. [2021-03-26 00:14:40,903 INFO L132 encePairwiseOnDemand]: 185/191 looper letters, 8 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2021-03-26 00:14:40,903 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 152 flow [2021-03-26 00:14:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:14:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:14:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 828 transitions. [2021-03-26 00:14:40,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8670157068062827 [2021-03-26 00:14:40,906 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 828 transitions. [2021-03-26 00:14:40,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 828 transitions. [2021-03-26 00:14:40,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:40,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 828 transitions. [2021-03-26 00:14:40,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.6) internal successors, (828), 5 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,910 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,911 INFO L185 Difference]: Start difference. First operand has 37 places, 26 transitions, 100 flow. Second operand 5 states and 828 transitions. [2021-03-26 00:14:40,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 152 flow [2021-03-26 00:14:40,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:14:40,912 INFO L241 Difference]: Finished difference. Result has 42 places, 33 transitions, 154 flow [2021-03-26 00:14:40,913 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2021-03-26 00:14:40,913 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2021-03-26 00:14:40,913 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:40,913 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 33 transitions, 154 flow [2021-03-26 00:14:40,913 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 154 flow [2021-03-26 00:14:40,913 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 154 flow [2021-03-26 00:14:40,933 INFO L129 PetriNetUnfolder]: 74/212 cut-off events. [2021-03-26 00:14:40,933 INFO L130 PetriNetUnfolder]: For 142/164 co-relation queries the response was YES. [2021-03-26 00:14:40,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 212 events. 74/212 cut-off events. For 142/164 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1151 event pairs, 35 based on Foata normal form. 6/209 useless extension candidates. Maximal degree in co-relation 574. Up to 108 conditions per place. [2021-03-26 00:14:40,936 INFO L142 LiptonReduction]: Number of co-enabled transitions 366 [2021-03-26 00:14:40,944 INFO L154 LiptonReduction]: Checked pairs total: 423 [2021-03-26 00:14:40,944 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:14:40,944 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-03-26 00:14:40,945 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 148 flow [2021-03-26 00:14:40,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:40,946 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:40,946 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:40,946 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:14:40,946 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:40,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:40,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2083968916, now seen corresponding path program 1 times [2021-03-26 00:14:40,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:40,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505482853] [2021-03-26 00:14:40,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:40,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:40,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:40,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:40,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:40,985 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:14:40,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:14:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:41,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505482853] [2021-03-26 00:14:41,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:41,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:14:41,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20410552] [2021-03-26 00:14:41,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:14:41,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:41,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:14:41,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:14:41,002 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 191 [2021-03-26 00:14:41,003 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,003 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:41,003 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 191 [2021-03-26 00:14:41,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:41,078 INFO L129 PetriNetUnfolder]: 112/285 cut-off events. [2021-03-26 00:14:41,078 INFO L130 PetriNetUnfolder]: For 342/381 co-relation queries the response was YES. [2021-03-26 00:14:41,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 285 events. 112/285 cut-off events. For 342/381 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1567 event pairs, 41 based on Foata normal form. 18/283 useless extension candidates. Maximal degree in co-relation 846. Up to 139 conditions per place. [2021-03-26 00:14:41,082 INFO L132 encePairwiseOnDemand]: 183/191 looper letters, 8 selfloop transitions, 12 changer transitions 0/38 dead transitions. [2021-03-26 00:14:41,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 215 flow [2021-03-26 00:14:41,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:14:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:14:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 754 transitions. [2021-03-26 00:14:41,085 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7895287958115184 [2021-03-26 00:14:41,085 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 754 transitions. [2021-03-26 00:14:41,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 754 transitions. [2021-03-26 00:14:41,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:41,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 754 transitions. [2021-03-26 00:14:41,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,090 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,090 INFO L185 Difference]: Start difference. First operand has 42 places, 32 transitions, 148 flow. Second operand 5 states and 754 transitions. [2021-03-26 00:14:41,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 215 flow [2021-03-26 00:14:41,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 209 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:14:41,095 INFO L241 Difference]: Finished difference. Result has 44 places, 36 transitions, 206 flow [2021-03-26 00:14:41,095 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2021-03-26 00:14:41,095 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -8 predicate places. [2021-03-26 00:14:41,096 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:41,096 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 206 flow [2021-03-26 00:14:41,096 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 206 flow [2021-03-26 00:14:41,096 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 206 flow [2021-03-26 00:14:41,125 INFO L129 PetriNetUnfolder]: 117/306 cut-off events. [2021-03-26 00:14:41,125 INFO L130 PetriNetUnfolder]: For 250/271 co-relation queries the response was YES. [2021-03-26 00:14:41,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 306 events. 117/306 cut-off events. For 250/271 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1753 event pairs, 49 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 844. Up to 164 conditions per place. [2021-03-26 00:14:41,129 INFO L142 LiptonReduction]: Number of co-enabled transitions 354 [2021-03-26 00:14:41,196 INFO L154 LiptonReduction]: Checked pairs total: 424 [2021-03-26 00:14:41,196 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:14:41,196 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 101 [2021-03-26 00:14:41,197 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 208 flow [2021-03-26 00:14:41,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,198 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:41,198 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:41,198 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:14:41,198 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1331069942, now seen corresponding path program 2 times [2021-03-26 00:14:41,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:41,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979162264] [2021-03-26 00:14:41,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:41,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:41,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:41,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:41,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:41,248 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:14:41,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:14:41,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:41,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:41,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979162264] [2021-03-26 00:14:41,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:41,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:14:41,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884603127] [2021-03-26 00:14:41,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:14:41,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:41,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:14:41,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:14:41,263 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 192 [2021-03-26 00:14:41,263 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,264 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:41,264 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 192 [2021-03-26 00:14:41,264 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:41,323 INFO L129 PetriNetUnfolder]: 69/227 cut-off events. [2021-03-26 00:14:41,324 INFO L130 PetriNetUnfolder]: For 238/300 co-relation queries the response was YES. [2021-03-26 00:14:41,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 227 events. 69/227 cut-off events. For 238/300 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1227 event pairs, 9 based on Foata normal form. 61/284 useless extension candidates. Maximal degree in co-relation 766. Up to 128 conditions per place. [2021-03-26 00:14:41,325 INFO L132 encePairwiseOnDemand]: 186/192 looper letters, 5 selfloop transitions, 11 changer transitions 3/46 dead transitions. [2021-03-26 00:14:41,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 304 flow [2021-03-26 00:14:41,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:14:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:14:41,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 999 transitions. [2021-03-26 00:14:41,328 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8671875 [2021-03-26 00:14:41,328 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 999 transitions. [2021-03-26 00:14:41,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 999 transitions. [2021-03-26 00:14:41,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:41,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 999 transitions. [2021-03-26 00:14:41,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 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-03-26 00:14:41,333 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 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-03-26 00:14:41,333 INFO L185 Difference]: Start difference. First operand has 44 places, 36 transitions, 208 flow. Second operand 6 states and 999 transitions. [2021-03-26 00:14:41,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 304 flow [2021-03-26 00:14:41,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 294 flow, removed 5 selfloop flow, removed 0 redundant places. [2021-03-26 00:14:41,336 INFO L241 Difference]: Finished difference. Result has 52 places, 43 transitions, 286 flow [2021-03-26 00:14:41,337 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2021-03-26 00:14:41,337 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2021-03-26 00:14:41,337 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:41,337 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 43 transitions, 286 flow [2021-03-26 00:14:41,337 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 43 transitions, 286 flow [2021-03-26 00:14:41,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 286 flow [2021-03-26 00:14:41,365 INFO L129 PetriNetUnfolder]: 66/228 cut-off events. [2021-03-26 00:14:41,365 INFO L130 PetriNetUnfolder]: For 444/464 co-relation queries the response was YES. [2021-03-26 00:14:41,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 228 events. 66/228 cut-off events. For 444/464 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1265 event pairs, 13 based on Foata normal form. 1/225 useless extension candidates. Maximal degree in co-relation 838. Up to 126 conditions per place. [2021-03-26 00:14:41,369 INFO L142 LiptonReduction]: Number of co-enabled transitions 436 [2021-03-26 00:14:41,466 INFO L154 LiptonReduction]: Checked pairs total: 653 [2021-03-26 00:14:41,466 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:14:41,467 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 130 [2021-03-26 00:14:41,467 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 278 flow [2021-03-26 00:14:41,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,468 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:41,468 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:41,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:14:41,468 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:41,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:41,468 INFO L82 PathProgramCache]: Analyzing trace with hash 714250926, now seen corresponding path program 1 times [2021-03-26 00:14:41,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:41,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967153417] [2021-03-26 00:14:41,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:41,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:41,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:41,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:41,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:41,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:41,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:41,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967153417] [2021-03-26 00:14:41,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:41,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:14:41,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132047852] [2021-03-26 00:14:41,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:14:41,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:41,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:14:41,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:14:41,525 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 192 [2021-03-26 00:14:41,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:41,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 192 [2021-03-26 00:14:41,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:41,566 INFO L129 PetriNetUnfolder]: 64/211 cut-off events. [2021-03-26 00:14:41,566 INFO L130 PetriNetUnfolder]: For 462/484 co-relation queries the response was YES. [2021-03-26 00:14:41,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 211 events. 64/211 cut-off events. For 462/484 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1057 event pairs, 11 based on Foata normal form. 8/214 useless extension candidates. Maximal degree in co-relation 767. Up to 100 conditions per place. [2021-03-26 00:14:41,568 INFO L132 encePairwiseOnDemand]: 188/192 looper letters, 3 selfloop transitions, 3 changer transitions 4/39 dead transitions. [2021-03-26 00:14:41,568 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 39 transitions, 262 flow [2021-03-26 00:14:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:14:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:14:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 651 transitions. [2021-03-26 00:14:41,570 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.84765625 [2021-03-26 00:14:41,570 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 651 transitions. [2021-03-26 00:14:41,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 651 transitions. [2021-03-26 00:14:41,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:41,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 651 transitions. [2021-03-26 00:14:41,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,574 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,574 INFO L185 Difference]: Start difference. First operand has 52 places, 42 transitions, 278 flow. Second operand 4 states and 651 transitions. [2021-03-26 00:14:41,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 39 transitions, 262 flow [2021-03-26 00:14:41,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 242 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-26 00:14:41,579 INFO L241 Difference]: Finished difference. Result has 51 places, 35 transitions, 207 flow [2021-03-26 00:14:41,579 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2021-03-26 00:14:41,579 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2021-03-26 00:14:41,579 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:41,579 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 35 transitions, 207 flow [2021-03-26 00:14:41,579 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 35 transitions, 207 flow [2021-03-26 00:14:41,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 35 transitions, 207 flow [2021-03-26 00:14:41,594 INFO L129 PetriNetUnfolder]: 43/159 cut-off events. [2021-03-26 00:14:41,594 INFO L130 PetriNetUnfolder]: For 260/269 co-relation queries the response was YES. [2021-03-26 00:14:41,595 INFO L84 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 159 events. 43/159 cut-off events. For 260/269 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 745 event pairs, 7 based on Foata normal form. 1/156 useless extension candidates. Maximal degree in co-relation 499. Up to 49 conditions per place. [2021-03-26 00:14:41,596 INFO L142 LiptonReduction]: Number of co-enabled transitions 296 [2021-03-26 00:14:41,600 INFO L154 LiptonReduction]: Checked pairs total: 244 [2021-03-26 00:14:41,601 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:14:41,601 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-26 00:14:41,603 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 207 flow [2021-03-26 00:14:41,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:41,604 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:41,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:14:41,604 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:41,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:41,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1470914763, now seen corresponding path program 1 times [2021-03-26 00:14:41,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:41,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19082127] [2021-03-26 00:14:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:41,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:41,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:41,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:41,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:41,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:41,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:41,729 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:14:41,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:14:41,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:41,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:41,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19082127] [2021-03-26 00:14:41,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:41,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:14:41,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843422584] [2021-03-26 00:14:41,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:14:41,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:41,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:14:41,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:14:41,740 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 192 [2021-03-26 00:14:41,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:41,741 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 192 [2021-03-26 00:14:41,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:41,796 INFO L129 PetriNetUnfolder]: 32/129 cut-off events. [2021-03-26 00:14:41,797 INFO L130 PetriNetUnfolder]: For 213/246 co-relation queries the response was YES. [2021-03-26 00:14:41,797 INFO L84 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 129 events. 32/129 cut-off events. For 213/246 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 543 event pairs, 2 based on Foata normal form. 35/161 useless extension candidates. Maximal degree in co-relation 459. Up to 41 conditions per place. [2021-03-26 00:14:41,798 INFO L132 encePairwiseOnDemand]: 186/192 looper letters, 2 selfloop transitions, 11 changer transitions 7/39 dead transitions. [2021-03-26 00:14:41,798 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 39 transitions, 269 flow [2021-03-26 00:14:41,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:14:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:14:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1159 transitions. [2021-03-26 00:14:41,800 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8623511904761905 [2021-03-26 00:14:41,801 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1159 transitions. [2021-03-26 00:14:41,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1159 transitions. [2021-03-26 00:14:41,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:41,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1159 transitions. [2021-03-26 00:14:41,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 165.57142857142858) internal successors, (1159), 7 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,806 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:41,806 INFO L185 Difference]: Start difference. First operand has 51 places, 35 transitions, 207 flow. Second operand 7 states and 1159 transitions. [2021-03-26 00:14:41,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 39 transitions, 269 flow [2021-03-26 00:14:41,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 39 transitions, 237 flow, removed 10 selfloop flow, removed 5 redundant places. [2021-03-26 00:14:41,809 INFO L241 Difference]: Finished difference. Result has 55 places, 32 transitions, 193 flow [2021-03-26 00:14:41,809 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=193, PETRI_PLACES=55, PETRI_TRANSITIONS=32} [2021-03-26 00:14:41,810 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2021-03-26 00:14:41,810 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:41,810 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 32 transitions, 193 flow [2021-03-26 00:14:41,810 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 32 transitions, 193 flow [2021-03-26 00:14:41,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 32 transitions, 193 flow [2021-03-26 00:14:41,820 INFO L129 PetriNetUnfolder]: 16/79 cut-off events. [2021-03-26 00:14:41,820 INFO L130 PetriNetUnfolder]: For 118/127 co-relation queries the response was YES. [2021-03-26 00:14:41,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 79 events. 16/79 cut-off events. For 118/127 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 252 event pairs, 5 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 253. Up to 22 conditions per place. [2021-03-26 00:14:41,821 INFO L142 LiptonReduction]: Number of co-enabled transitions 230 [2021-03-26 00:14:42,180 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-26 00:14:42,319 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-26 00:14:42,689 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-26 00:14:42,829 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-26 00:14:42,833 INFO L154 LiptonReduction]: Checked pairs total: 379 [2021-03-26 00:14:42,833 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:14:42,833 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1023 [2021-03-26 00:14:42,834 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 179 flow [2021-03-26 00:14:42,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:42,834 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:42,834 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:42,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:14:42,835 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:42,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:42,835 INFO L82 PathProgramCache]: Analyzing trace with hash -233573944, now seen corresponding path program 1 times [2021-03-26 00:14:42,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:42,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233512324] [2021-03-26 00:14:42,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:42,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:42,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:42,889 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-26 00:14:42,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 00:14:42,902 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-03-26 00:14:42,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 00:14:42,919 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:14:42,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:14:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:42,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233512324] [2021-03-26 00:14:42,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:42,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:14:42,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259996289] [2021-03-26 00:14:42,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:14:42,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:42,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:14:42,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:14:42,932 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 194 [2021-03-26 00:14:42,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 29 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:42,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:42,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 194 [2021-03-26 00:14:42,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:43,086 INFO L129 PetriNetUnfolder]: 99/272 cut-off events. [2021-03-26 00:14:43,087 INFO L130 PetriNetUnfolder]: For 1304/1378 co-relation queries the response was YES. [2021-03-26 00:14:43,088 INFO L84 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 272 events. 99/272 cut-off events. For 1304/1378 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1408 event pairs, 9 based on Foata normal form. 46/310 useless extension candidates. Maximal degree in co-relation 935. Up to 92 conditions per place. [2021-03-26 00:14:43,089 INFO L132 encePairwiseOnDemand]: 185/194 looper letters, 15 selfloop transitions, 13 changer transitions 8/52 dead transitions. [2021-03-26 00:14:43,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 365 flow [2021-03-26 00:14:43,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:14:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:14:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 946 transitions. [2021-03-26 00:14:43,092 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6966126656848306 [2021-03-26 00:14:43,092 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 946 transitions. [2021-03-26 00:14:43,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 946 transitions. [2021-03-26 00:14:43,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:43,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 946 transitions. [2021-03-26 00:14:43,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:43,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:43,098 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:43,098 INFO L185 Difference]: Start difference. First operand has 49 places, 29 transitions, 179 flow. Second operand 7 states and 946 transitions. [2021-03-26 00:14:43,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 365 flow [2021-03-26 00:14:43,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 319 flow, removed 12 selfloop flow, removed 8 redundant places. [2021-03-26 00:14:43,101 INFO L241 Difference]: Finished difference. Result has 51 places, 38 transitions, 231 flow [2021-03-26 00:14:43,102 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=231, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2021-03-26 00:14:43,102 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2021-03-26 00:14:43,102 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:43,102 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 38 transitions, 231 flow [2021-03-26 00:14:43,102 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 38 transitions, 231 flow [2021-03-26 00:14:43,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 38 transitions, 231 flow [2021-03-26 00:14:43,121 INFO L129 PetriNetUnfolder]: 57/184 cut-off events. [2021-03-26 00:14:43,121 INFO L130 PetriNetUnfolder]: For 338/396 co-relation queries the response was YES. [2021-03-26 00:14:43,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 184 events. 57/184 cut-off events. For 338/396 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 914 event pairs, 12 based on Foata normal form. 25/197 useless extension candidates. Maximal degree in co-relation 560. Up to 41 conditions per place. [2021-03-26 00:14:43,123 INFO L142 LiptonReduction]: Number of co-enabled transitions 268 [2021-03-26 00:14:43,330 INFO L154 LiptonReduction]: Checked pairs total: 64 [2021-03-26 00:14:43,331 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:14:43,331 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 229 [2021-03-26 00:14:43,331 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 236 flow [2021-03-26 00:14:43,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:43,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:43,332 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:43,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:14:43,332 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:43,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:43,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1759310384, now seen corresponding path program 1 times [2021-03-26 00:14:43,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:43,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313401963] [2021-03-26 00:14:43,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:43,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:43,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:43,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:43,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:43,416 INFO L142 QuantifierPusher]: treesize reduction 7, result has 76.7 percent of original size [2021-03-26 00:14:43,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 00:14:43,432 INFO L142 QuantifierPusher]: treesize reduction 8, result has 84.6 percent of original size [2021-03-26 00:14:43,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 00:14:43,462 INFO L142 QuantifierPusher]: treesize reduction 17, result has 69.6 percent of original size [2021-03-26 00:14:43,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:14:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:43,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313401963] [2021-03-26 00:14:43,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:43,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:14:43,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565879871] [2021-03-26 00:14:43,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:14:43,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:43,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:14:43,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:14:43,486 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 198 [2021-03-26 00:14:43,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:43,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:43,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 198 [2021-03-26 00:14:43,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:43,679 INFO L129 PetriNetUnfolder]: 129/348 cut-off events. [2021-03-26 00:14:43,679 INFO L130 PetriNetUnfolder]: For 1031/1177 co-relation queries the response was YES. [2021-03-26 00:14:43,681 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1295 conditions, 348 events. 129/348 cut-off events. For 1031/1177 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1921 event pairs, 10 based on Foata normal form. 62/394 useless extension candidates. Maximal degree in co-relation 1272. Up to 119 conditions per place. [2021-03-26 00:14:43,682 INFO L132 encePairwiseOnDemand]: 183/198 looper letters, 16 selfloop transitions, 23 changer transitions 11/65 dead transitions. [2021-03-26 00:14:43,682 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 494 flow [2021-03-26 00:14:43,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:14:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:14:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1092 transitions. [2021-03-26 00:14:43,685 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6893939393939394 [2021-03-26 00:14:43,685 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1092 transitions. [2021-03-26 00:14:43,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1092 transitions. [2021-03-26 00:14:43,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:43,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1092 transitions. [2021-03-26 00:14:43,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 136.5) internal successors, (1092), 8 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:43,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:43,691 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:43,691 INFO L185 Difference]: Start difference. First operand has 50 places, 38 transitions, 236 flow. Second operand 8 states and 1092 transitions. [2021-03-26 00:14:43,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 494 flow [2021-03-26 00:14:43,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 483 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-26 00:14:43,696 INFO L241 Difference]: Finished difference. Result has 58 places, 49 transitions, 387 flow [2021-03-26 00:14:43,696 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=387, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2021-03-26 00:14:43,696 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2021-03-26 00:14:43,696 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:43,696 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 49 transitions, 387 flow [2021-03-26 00:14:43,696 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 49 transitions, 387 flow [2021-03-26 00:14:43,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 387 flow [2021-03-26 00:14:43,725 INFO L129 PetriNetUnfolder]: 82/262 cut-off events. [2021-03-26 00:14:43,725 INFO L130 PetriNetUnfolder]: For 752/877 co-relation queries the response was YES. [2021-03-26 00:14:43,726 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 262 events. 82/262 cut-off events. For 752/877 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1507 event pairs, 8 based on Foata normal form. 20/264 useless extension candidates. Maximal degree in co-relation 996. Up to 65 conditions per place. [2021-03-26 00:14:43,728 INFO L142 LiptonReduction]: Number of co-enabled transitions 304 [2021-03-26 00:14:43,849 INFO L154 LiptonReduction]: Checked pairs total: 43 [2021-03-26 00:14:43,849 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:14:43,849 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 153 [2021-03-26 00:14:43,850 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 397 flow [2021-03-26 00:14:43,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:43,850 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:43,851 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:43,851 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:14:43,851 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:43,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:43,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2068498776, now seen corresponding path program 1 times [2021-03-26 00:14:43,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:43,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290016434] [2021-03-26 00:14:43,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:43,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:43,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:43,959 INFO L142 QuantifierPusher]: treesize reduction 22, result has 70.3 percent of original size [2021-03-26 00:14:43,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-26 00:14:43,996 INFO L142 QuantifierPusher]: treesize reduction 31, result has 72.6 percent of original size [2021-03-26 00:14:43,998 INFO L147 QuantifierPusher]: treesize reduction 8, result has 90.2 percent of original size 74 [2021-03-26 00:14:44,030 INFO L142 QuantifierPusher]: treesize reduction 26, result has 55.2 percent of original size [2021-03-26 00:14:44,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 00:14:44,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:44,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:14:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:44,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290016434] [2021-03-26 00:14:44,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:44,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:14:44,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820118890] [2021-03-26 00:14:44,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:14:44,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:44,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:14:44,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:14:44,060 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 200 [2021-03-26 00:14:44,061 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 397 flow. Second operand has 7 states, 7 states have (on average 149.0) internal successors, (1043), 7 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:44,061 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:44,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 200 [2021-03-26 00:14:44,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:44,207 INFO L129 PetriNetUnfolder]: 99/316 cut-off events. [2021-03-26 00:14:44,208 INFO L130 PetriNetUnfolder]: For 1429/1598 co-relation queries the response was YES. [2021-03-26 00:14:44,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 316 events. 99/316 cut-off events. For 1429/1598 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1865 event pairs, 12 based on Foata normal form. 59/357 useless extension candidates. Maximal degree in co-relation 1275. Up to 73 conditions per place. [2021-03-26 00:14:44,210 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 7 selfloop transitions, 12 changer transitions 10/56 dead transitions. [2021-03-26 00:14:44,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 56 transitions, 506 flow [2021-03-26 00:14:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:14:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:14:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 907 transitions. [2021-03-26 00:14:44,213 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7558333333333334 [2021-03-26 00:14:44,213 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 907 transitions. [2021-03-26 00:14:44,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 907 transitions. [2021-03-26 00:14:44,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:44,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 907 transitions. [2021-03-26 00:14:44,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 151.16666666666666) internal successors, (907), 6 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:44,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:44,218 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:44,218 INFO L185 Difference]: Start difference. First operand has 58 places, 49 transitions, 397 flow. Second operand 6 states and 907 transitions. [2021-03-26 00:14:44,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 56 transitions, 506 flow [2021-03-26 00:14:44,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 56 transitions, 478 flow, removed 14 selfloop flow, removed 0 redundant places. [2021-03-26 00:14:44,224 INFO L241 Difference]: Finished difference. Result has 65 places, 45 transitions, 372 flow [2021-03-26 00:14:44,224 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2021-03-26 00:14:44,225 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2021-03-26 00:14:44,225 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:44,225 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 45 transitions, 372 flow [2021-03-26 00:14:44,225 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 45 transitions, 372 flow [2021-03-26 00:14:44,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 45 transitions, 372 flow [2021-03-26 00:14:44,252 INFO L129 PetriNetUnfolder]: 63/212 cut-off events. [2021-03-26 00:14:44,252 INFO L130 PetriNetUnfolder]: For 740/818 co-relation queries the response was YES. [2021-03-26 00:14:44,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 212 events. 63/212 cut-off events. For 740/818 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1154 event pairs, 5 based on Foata normal form. 17/215 useless extension candidates. Maximal degree in co-relation 827. Up to 47 conditions per place. [2021-03-26 00:14:44,254 INFO L142 LiptonReduction]: Number of co-enabled transitions 246 [2021-03-26 00:14:44,322 INFO L154 LiptonReduction]: Checked pairs total: 64 [2021-03-26 00:14:44,322 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:14:44,322 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 97 [2021-03-26 00:14:44,324 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 373 flow [2021-03-26 00:14:44,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 149.0) internal successors, (1043), 7 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:44,325 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:44,325 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:44,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:14:44,325 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:44,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:44,325 INFO L82 PathProgramCache]: Analyzing trace with hash 290096722, now seen corresponding path program 1 times [2021-03-26 00:14:44,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:44,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56684469] [2021-03-26 00:14:44,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:14:44,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:44,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:14:44,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:44,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:44,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:14:44,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:14:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:14:44,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56684469] [2021-03-26 00:14:44,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:14:44,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:14:44,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392102247] [2021-03-26 00:14:44,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:14:44,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:14:44,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:14:44,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:14:44,393 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 202 [2021-03-26 00:14:44,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 373 flow. Second operand has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:44,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:14:44,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 202 [2021-03-26 00:14:44,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:14:44,438 INFO L129 PetriNetUnfolder]: 67/236 cut-off events. [2021-03-26 00:14:44,438 INFO L130 PetriNetUnfolder]: For 1022/1121 co-relation queries the response was YES. [2021-03-26 00:14:44,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 236 events. 67/236 cut-off events. For 1022/1121 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1383 event pairs, 4 based on Foata normal form. 24/247 useless extension candidates. Maximal degree in co-relation 930. Up to 56 conditions per place. [2021-03-26 00:14:44,440 INFO L132 encePairwiseOnDemand]: 196/202 looper letters, 3 selfloop transitions, 1 changer transitions 18/44 dead transitions. [2021-03-26 00:14:44,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 44 transitions, 391 flow [2021-03-26 00:14:44,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:14:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:14:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2021-03-26 00:14:44,443 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8378712871287128 [2021-03-26 00:14:44,443 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 677 transitions. [2021-03-26 00:14:44,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 677 transitions. [2021-03-26 00:14:44,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:14:44,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 677 transitions. [2021-03-26 00:14:44,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:44,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:44,446 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:44,446 INFO L185 Difference]: Start difference. First operand has 63 places, 44 transitions, 373 flow. Second operand 4 states and 677 transitions. [2021-03-26 00:14:44,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 44 transitions, 391 flow [2021-03-26 00:14:44,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 44 transitions, 343 flow, removed 5 selfloop flow, removed 7 redundant places. [2021-03-26 00:14:44,451 INFO L241 Difference]: Finished difference. Result has 60 places, 26 transitions, 176 flow [2021-03-26 00:14:44,451 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=60, PETRI_TRANSITIONS=26} [2021-03-26 00:14:44,451 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2021-03-26 00:14:44,451 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:14:44,452 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 26 transitions, 176 flow [2021-03-26 00:14:44,452 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 26 transitions, 176 flow [2021-03-26 00:14:44,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 26 transitions, 176 flow [2021-03-26 00:14:44,459 INFO L129 PetriNetUnfolder]: 16/59 cut-off events. [2021-03-26 00:14:44,459 INFO L130 PetriNetUnfolder]: For 118/125 co-relation queries the response was YES. [2021-03-26 00:14:44,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 59 events. 16/59 cut-off events. For 118/125 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 2 based on Foata normal form. 2/58 useless extension candidates. Maximal degree in co-relation 190. Up to 18 conditions per place. [2021-03-26 00:14:44,460 INFO L142 LiptonReduction]: Number of co-enabled transitions 88 [2021-03-26 00:14:44,623 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:14:44,970 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:14:45,094 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:14:45,756 WARN L205 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 181 [2021-03-26 00:14:46,026 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2021-03-26 00:14:47,331 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 306 DAG size of output: 262 [2021-03-26 00:14:48,052 WARN L205 SmtUtils]: Spent 719.00 ms on a formula simplification that was a NOOP. DAG size: 259 [2021-03-26 00:14:48,339 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:14:48,456 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:14:48,489 INFO L154 LiptonReduction]: Checked pairs total: 31 [2021-03-26 00:14:48,490 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:14:48,490 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4039 [2021-03-26 00:14:48,490 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 25 transitions, 191 flow [2021-03-26 00:14:48,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:48,491 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:48,491 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:48,491 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:14:48,491 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:48,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:48,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1457561020, now seen corresponding path program 1 times [2021-03-26 00:14:48,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:48,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656124007] [2021-03-26 00:14:48,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:14:48,526 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:14:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:14:48,560 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:14:48,590 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:14:48,590 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:14:48,590 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:14:48,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:14:48 BasicIcfg [2021-03-26 00:14:48,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:14:48,690 INFO L168 Benchmark]: Toolchain (without parser) took 17773.52 ms. Allocated memory was 255.9 MB in the beginning and 612.4 MB in the end (delta: 356.5 MB). Free memory was 234.2 MB in the beginning and 386.1 MB in the end (delta: -151.9 MB). Peak memory consumption was 203.5 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:48,690 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:14:48,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.63 ms. Allocated memory was 255.9 MB in the beginning and 352.3 MB in the end (delta: 96.5 MB). Free memory was 233.6 MB in the beginning and 311.0 MB in the end (delta: -77.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:48,691 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.88 ms. Allocated memory is still 352.3 MB. Free memory was 311.0 MB in the beginning and 308.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:48,691 INFO L168 Benchmark]: Boogie Preprocessor took 54.24 ms. Allocated memory is still 352.3 MB. Free memory was 308.2 MB in the beginning and 306.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:48,691 INFO L168 Benchmark]: RCFGBuilder took 1863.88 ms. Allocated memory is still 352.3 MB. Free memory was 306.0 MB in the beginning and 283.5 MB in the end (delta: 22.5 MB). Peak memory consumption was 61.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:48,692 INFO L168 Benchmark]: TraceAbstraction took 15232.11 ms. Allocated memory was 352.3 MB in the beginning and 612.4 MB in the end (delta: 260.0 MB). Free memory was 282.4 MB in the beginning and 386.1 MB in the end (delta: -103.7 MB). Peak memory consumption was 156.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:48,693 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.47 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 545.63 ms. Allocated memory was 255.9 MB in the beginning and 352.3 MB in the end (delta: 96.5 MB). Free memory was 233.6 MB in the beginning and 311.0 MB in the end (delta: -77.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 71.88 ms. Allocated memory is still 352.3 MB. Free memory was 311.0 MB in the beginning and 308.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 54.24 ms. Allocated memory is still 352.3 MB. Free memory was 308.2 MB in the beginning and 306.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1863.88 ms. Allocated memory is still 352.3 MB. Free memory was 306.0 MB in the beginning and 283.5 MB in the end (delta: 22.5 MB). Peak memory consumption was 61.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 15232.11 ms. Allocated memory was 352.3 MB in the beginning and 612.4 MB in the end (delta: 260.0 MB). Free memory was 282.4 MB in the beginning and 386.1 MB in the end (delta: -103.7 MB). Peak memory consumption was 156.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2957.1ms, 112 PlacesBefore, 52 PlacesAfterwards, 104 TransitionsBefore, 43 TransitionsAfterwards, 2054 CoEnabledTransitionPairs, 4 FixpointIterations, 30 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, 3242 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1817, positive: 1738, positive conditional: 1738, positive unconditional: 0, negative: 79, negative conditional: 79, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1334, positive: 1300, positive conditional: 0, positive unconditional: 1300, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1334, positive: 1300, positive conditional: 0, positive unconditional: 1300, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1334, positive: 1292, positive conditional: 0, positive unconditional: 1292, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 474, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 449, negative conditional: 0, negative unconditional: 449, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1817, positive: 438, positive conditional: 438, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 1334, unknown conditional: 1334, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 137, Positive conditional cache size: 137, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1576.1ms, 49 PlacesBefore, 36 PlacesAfterwards, 40 TransitionsBefore, 27 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 3 FixpointIterations, 8 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 1436 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 502, positive: 419, positive conditional: 419, positive unconditional: 0, negative: 83, negative conditional: 83, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, positive: 142, positive conditional: 21, positive unconditional: 121, negative: 21, negative conditional: 1, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 163, positive: 142, positive conditional: 21, positive unconditional: 121, negative: 21, negative conditional: 1, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 163, positive: 137, positive conditional: 0, positive unconditional: 137, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 21, negative conditional: 1, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 181, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 160, negative conditional: 16, negative unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 502, positive: 277, positive conditional: 277, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 163, unknown conditional: 163, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 134, Positive conditional cache size: 134, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1560.8ms, 40 PlacesBefore, 34 PlacesAfterwards, 29 TransitionsBefore, 26 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 576 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 183, positive: 144, positive conditional: 144, positive unconditional: 0, negative: 39, negative conditional: 39, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 15, positive conditional: 2, positive unconditional: 13, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 15, positive conditional: 2, positive unconditional: 13, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 130, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 125, negative conditional: 0, negative unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 183, positive: 129, positive conditional: 129, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 149, Positive conditional cache size: 149, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.3ms, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 191 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 7, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 7, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 68, positive: 47, positive conditional: 47, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 157, Positive conditional cache size: 157, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.8ms, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 220 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 81, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 7, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 7, positive unconditional: 6, 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: 14, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 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: 24, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 170, Positive conditional cache size: 170, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.0ms, 42 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 423 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 94, positive conditional: 94, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, positive: 29, positive conditional: 19, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, positive: 29, positive conditional: 19, positive unconditional: 10, 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: 29, positive: 29, positive conditional: 0, positive unconditional: 29, 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: 116, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 162, Positive conditional cache size: 162, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 100.4ms, 44 PlacesBefore, 44 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 424 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 95, positive conditional: 95, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, positive: 28, positive conditional: 18, positive unconditional: 10, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, positive: 28, positive conditional: 18, positive unconditional: 10, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 4, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 30, unknown conditional: 30, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 154, Positive conditional cache size: 154, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 129.3ms, 52 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 653 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 208, positive: 180, positive conditional: 180, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, positive: 51, positive conditional: 41, positive unconditional: 10, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 54, positive: 51, positive conditional: 41, positive unconditional: 10, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 54, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 208, positive: 129, positive conditional: 129, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 54, unknown conditional: 54, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 181, Positive conditional cache size: 181, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.2ms, 51 PlacesBefore, 51 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 244 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 85, positive: 72, positive conditional: 72, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 10, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 10, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 85, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 198, Positive conditional cache size: 198, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1023.1ms, 55 PlacesBefore, 49 PlacesAfterwards, 32 TransitionsBefore, 29 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 379 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 112, positive: 85, positive conditional: 85, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 15, 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: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 112, positive: 70, positive conditional: 70, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 183, Positive conditional cache size: 183, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 228.2ms, 51 PlacesBefore, 50 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 64 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 20, positive conditional: 13, positive unconditional: 7, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 20, positive conditional: 13, positive unconditional: 7, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, positive: 20, positive conditional: 0, positive unconditional: 20, 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: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 189, Positive conditional cache size: 189, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 153.1ms, 58 PlacesBefore, 58 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 43 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 20, positive conditional: 17, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 20, positive conditional: 17, positive unconditional: 3, 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: 21, positive: 20, positive conditional: 0, positive unconditional: 20, 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: 19, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 123, Positive conditional cache size: 123, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 97.1ms, 65 PlacesBefore, 63 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 64 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 5, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 5, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 88, Positive conditional cache size: 88, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4037.7ms, 60 PlacesBefore, 49 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 31 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 7, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 7, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 67, Positive conditional cache size: 67, Positive unconditional cache size: 0, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool b$flush_delayed; [L725] 0 int b$mem_tmp; [L726] 0 _Bool b$r_buff0_thd0; [L727] 0 _Bool b$r_buff0_thd1; [L728] 0 _Bool b$r_buff0_thd2; [L729] 0 _Bool b$r_buff0_thd3; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$read_delayed; [L735] 0 int *b$read_delayed_var; [L736] 0 int b$w_buff0; [L737] 0 _Bool b$w_buff0_used; [L738] 0 int b$w_buff1; [L739] 0 _Bool b$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t861; [L856] FCALL, FORK 0 pthread_create(&t861, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 b$w_buff1 = b$w_buff0 [L754] 1 b$w_buff0 = 1 [L755] 1 b$w_buff1_used = b$w_buff0_used [L756] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L758] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L759] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L760] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L761] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L762] 1 b$r_buff0_thd1 = (_Bool)1 [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t862; [L858] FCALL, FORK 0 pthread_create(&t862, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 [L785] 2 y = 1 [L788] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L859] 0 pthread_t t863; [L860] FCALL, FORK 0 pthread_create(&t863, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L808] 3 z = 1 [L811] 3 a = 1 [L814] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 b$flush_delayed = weak$$choice2 [L820] 3 b$mem_tmp = b [L821] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L821] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L822] EXPR 3 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L822] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0) [L822] EXPR 3 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L822] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L823] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L823] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1) [L823] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L823] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L824] EXPR 3 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L824] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used) [L824] EXPR 3 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L824] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L825] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L825] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L826] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3) [L826] EXPR 3 weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L826] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L827] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L827] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = b [L829] EXPR 3 b$flush_delayed ? b$mem_tmp : b [L829] 3 b = b$flush_delayed ? b$mem_tmp : b [L830] 3 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L794] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L794] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L795] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L795] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L796] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L796] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L797] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L797] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L798] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L798] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L833] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L833] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L833] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L833] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L834] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L834] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L835] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L835] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L836] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L836] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L837] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L837] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L866] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L866] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L866] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L866] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L867] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L867] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L868] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L868] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L869] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L869] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L870] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L870] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 14994.9ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1272.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3060.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 98 SDtfs, 50 SDslu, 59 SDs, 0 SdLazy, 313 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 385.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 382.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=397occurred in iteration=11, InterpolantAutomatonStates: 66, 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: 41.2ms SsaConstructionTime, 409.6ms SatisfiabilityAnalysisTime, 906.3ms InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 1475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...