/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:32:49,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:32:49,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:32:49,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:32:49,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:32:49,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:32:49,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:32:49,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:32:49,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:32:49,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:32:49,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:32:49,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:32:49,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:32:49,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:32:49,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:32:49,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:32:49,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:32:49,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:32:49,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:32:49,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:32:49,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:32:49,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:32:49,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:32:49,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:32:49,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:32:49,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:32:49,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:32:49,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:32:49,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:32:49,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:32:49,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:32:49,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:32:49,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:32:49,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:32:49,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:32:49,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:32:49,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:32:49,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:32:49,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:32:49,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:32:49,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:32:49,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:32:49,583 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:32:49,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:32:49,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:32:49,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:32:49,587 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:32:49,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:32:49,588 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:32:49,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:32:49,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:32:49,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:32:49,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:32:49,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:32:49,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:32:49,589 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:32:49,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:32:49,589 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:32:49,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:32:49,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:32:49,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:32:49,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:32:49,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:32:49,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:32:49,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:32:49,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:32:49,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:32:49,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:32:49,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:32:49,591 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:32:49,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:32:49,592 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:32:49,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:32:49,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:32:49,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:32:49,908 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:32:49,912 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:32:49,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_power.oepc.i [2021-03-25 14:32:49,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4064e183a/7e1a5e99228742cdac6b0b91c3a5683d/FLAG521dbddbc [2021-03-25 14:32:50,470 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:32:50,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_power.oepc.i [2021-03-25 14:32:50,487 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4064e183a/7e1a5e99228742cdac6b0b91c3a5683d/FLAG521dbddbc [2021-03-25 14:32:50,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4064e183a/7e1a5e99228742cdac6b0b91c3a5683d [2021-03-25 14:32:50,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:32:50,953 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:32:50,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:32:50,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:32:50,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:32:50,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:32:50" (1/1) ... [2021-03-25 14:32:50,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc802d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:50, skipping insertion in model container [2021-03-25 14:32:50,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:32:50" (1/1) ... [2021-03-25 14:32:50,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:32:51,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:32:51,118 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/mix043_power.oepc.i[951,964] [2021-03-25 14:32:51,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:32:51,363 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:32:51,380 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/mix043_power.oepc.i[951,964] [2021-03-25 14:32:51,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:32:51,523 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:32:51,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:51 WrapperNode [2021-03-25 14:32:51,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:32:51,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:32:51,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:32:51,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:32:51,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:51" (1/1) ... [2021-03-25 14:32:51,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:51" (1/1) ... [2021-03-25 14:32:51,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:32:51,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:32:51,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:32:51,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:32:51,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:51" (1/1) ... [2021-03-25 14:32:51,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:51" (1/1) ... [2021-03-25 14:32:51,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:51" (1/1) ... [2021-03-25 14:32:51,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:51" (1/1) ... [2021-03-25 14:32:51,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:51" (1/1) ... [2021-03-25 14:32:51,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:51" (1/1) ... [2021-03-25 14:32:51,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:51" (1/1) ... [2021-03-25 14:32:51,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:32:51,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:32:51,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:32:51,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:32:51,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:32:51,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:32:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:32:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:32:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:32:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:32:51,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:32:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:32:51,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:32:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:32:51,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:32:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:32:51,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:32:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:32:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:32:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:32:51,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:32:51,720 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:32:53,427 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:32:53,427 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:32:53,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:32:53 BoogieIcfgContainer [2021-03-25 14:32:53,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:32:53,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:32:53,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:32:53,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:32:53,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:32:50" (1/3) ... [2021-03-25 14:32:53,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f309fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:32:53, skipping insertion in model container [2021-03-25 14:32:53,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:51" (2/3) ... [2021-03-25 14:32:53,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f309fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:32:53, skipping insertion in model container [2021-03-25 14:32:53,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:32:53" (3/3) ... [2021-03-25 14:32:53,436 INFO L111 eAbstractionObserver]: Analyzing ICFG mix043_power.oepc.i [2021-03-25 14:32:53,442 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:32:53,446 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:32:53,446 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:32:53,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,492 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,492 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,492 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,492 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,493 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,493 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,493 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,493 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,498 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,499 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,499 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,499 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,502 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,502 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,503 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,503 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,507 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,507 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,508 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,508 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,516 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,523 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,523 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,523 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,523 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,523 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,523 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,523 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,523 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,524 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,524 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,524 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,524 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,524 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,524 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,524 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,524 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,525 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,525 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,525 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,527 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,527 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,528 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,533 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,533 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,536 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,536 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,537 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,537 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,537 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,546 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,551 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,551 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,551 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,556 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,556 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,558 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,559 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:53,560 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:32:53,576 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:32:53,602 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:32:53,602 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:32:53,602 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:32:53,602 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:32:53,602 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:32:53,603 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:32:53,603 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:32:53,603 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:32:53,615 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-25 14:32:53,665 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-25 14:32:53,665 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:53,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 14:32:53,679 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-25 14:32:53,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-25 14:32:53,687 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:53,697 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-25 14:32:53,699 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-25 14:32:53,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-25 14:32:53,764 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-25 14:32:53,764 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:53,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 14:32:53,768 INFO L142 LiptonReduction]: Number of co-enabled transitions 2876 [2021-03-25 14:32:55,226 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:32:55,683 WARN L205 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:32:55,796 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:32:57,391 INFO L154 LiptonReduction]: Checked pairs total: 5194 [2021-03-25 14:32:57,392 INFO L156 LiptonReduction]: Total number of compositions: 76 [2021-03-25 14:32:57,394 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3708 [2021-03-25 14:32:57,401 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-25 14:32:57,401 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:57,402 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:57,402 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:57,402 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:57,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1584989629, now seen corresponding path program 1 times [2021-03-25 14:32:57,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:57,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353266569] [2021-03-25 14:32:57,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:57,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:57,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:57,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:57,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:32:57,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353266569] [2021-03-25 14:32:57,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:57,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:32:57,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088271816] [2021-03-25 14:32:57,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:32:57,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:57,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:32:57,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:32:57,657 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 196 [2021-03-25 14:32:57,660 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:57,660 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:57,660 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 196 [2021-03-25 14:32:57,661 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:57,776 INFO L129 PetriNetUnfolder]: 133/384 cut-off events. [2021-03-25 14:32:57,777 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:57,781 INFO L84 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 384 events. 133/384 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2174 event pairs, 110 based on Foata normal form. 32/387 useless extension candidates. Maximal degree in co-relation 581. Up to 153 conditions per place. [2021-03-25 14:32:57,785 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 11 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2021-03-25 14:32:57,785 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 140 flow [2021-03-25 14:32:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:32:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:32:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2021-03-25 14:32:57,803 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9149659863945578 [2021-03-25 14:32:57,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 538 transitions. [2021-03-25 14:32:57,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 538 transitions. [2021-03-25 14:32:57,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:57,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 538 transitions. [2021-03-25 14:32:57,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:57,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:57,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:57,827 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 3 states and 538 transitions. [2021-03-25 14:32:57,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 140 flow [2021-03-25 14:32:57,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:32:57,832 INFO L241 Difference]: Finished difference. Result has 57 places, 46 transitions, 104 flow [2021-03-25 14:32:57,833 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2021-03-25 14:32:57,834 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2021-03-25 14:32:57,834 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:57,834 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-25 14:32:57,835 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-25 14:32:57,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 46 transitions, 104 flow [2021-03-25 14:32:57,842 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-25 14:32:57,842 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:57,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:32:57,845 INFO L142 LiptonReduction]: Number of co-enabled transitions 652 [2021-03-25 14:32:58,965 INFO L154 LiptonReduction]: Checked pairs total: 2761 [2021-03-25 14:32:58,966 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 14:32:58,966 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1132 [2021-03-25 14:32:58,967 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 80 flow [2021-03-25 14:32:58,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:58,967 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:58,968 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-25 14:32:58,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:32:58,968 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:58,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:58,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1061219016, now seen corresponding path program 1 times [2021-03-25 14:32:58,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:58,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284836171] [2021-03-25 14:32:58,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:59,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:59,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:59,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:59,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:59,120 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:32:59,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:32:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:32:59,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284836171] [2021-03-25 14:32:59,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:59,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:32:59,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295222070] [2021-03-25 14:32:59,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:32:59,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:59,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:32:59,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:32:59,129 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 208 [2021-03-25 14:32:59,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:59,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:59,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 208 [2021-03-25 14:32:59,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:59,162 INFO L129 PetriNetUnfolder]: 7/55 cut-off events. [2021-03-25 14:32:59,163 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:32:59,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 55 events. 7/55 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 118 event pairs, 1 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 73. Up to 10 conditions per place. [2021-03-25 14:32:59,163 INFO L132 encePairwiseOnDemand]: 203/208 looper letters, 3 selfloop transitions, 3 changer transitions 6/41 dead transitions. [2021-03-25 14:32:59,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 118 flow [2021-03-25 14:32:59,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:32:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:32:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 928 transitions. [2021-03-25 14:32:59,166 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8923076923076924 [2021-03-25 14:32:59,166 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 928 transitions. [2021-03-25 14:32:59,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 928 transitions. [2021-03-25 14:32:59,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:59,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 928 transitions. [2021-03-25 14:32:59,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 185.6) internal successors, (928), 5 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:59,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:59,172 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:59,172 INFO L185 Difference]: Start difference. First operand has 45 places, 34 transitions, 80 flow. Second operand 5 states and 928 transitions. [2021-03-25 14:32:59,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 118 flow [2021-03-25 14:32:59,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:32:59,173 INFO L241 Difference]: Finished difference. Result has 49 places, 35 transitions, 97 flow [2021-03-25 14:32:59,174 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2021-03-25 14:32:59,174 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -12 predicate places. [2021-03-25 14:32:59,174 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:59,174 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 35 transitions, 97 flow [2021-03-25 14:32:59,175 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 35 transitions, 97 flow [2021-03-25 14:32:59,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 97 flow [2021-03-25 14:32:59,181 INFO L129 PetriNetUnfolder]: 3/43 cut-off events. [2021-03-25 14:32:59,181 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-25 14:32:59,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 43 events. 3/43 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 87 event pairs, 1 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 58. Up to 10 conditions per place. [2021-03-25 14:32:59,182 INFO L142 LiptonReduction]: Number of co-enabled transitions 486 [2021-03-25 14:32:59,909 INFO L154 LiptonReduction]: Checked pairs total: 1458 [2021-03-25 14:32:59,910 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:32:59,910 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 736 [2021-03-25 14:32:59,911 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 89 flow [2021-03-25 14:32:59,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:59,911 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:59,912 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:59,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:32:59,912 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:59,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:59,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1042773214, now seen corresponding path program 1 times [2021-03-25 14:32:59,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:59,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286287637] [2021-03-25 14:32:59,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:59,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:59,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:32:59,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286287637] [2021-03-25 14:32:59,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:59,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:32:59,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398920605] [2021-03-25 14:32:59,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:32:59,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:59,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:32:59,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:32:59,989 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 213 [2021-03-25 14:32:59,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:59,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:59,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 213 [2021-03-25 14:32:59,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:00,004 INFO L129 PetriNetUnfolder]: 2/36 cut-off events. [2021-03-25 14:33:00,004 INFO L130 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2021-03-25 14:33:00,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 36 events. 2/36 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 69 event pairs, 0 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 55. Up to 8 conditions per place. [2021-03-25 14:33:00,005 INFO L132 encePairwiseOnDemand]: 209/213 looper letters, 1 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-03-25 14:33:00,005 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 97 flow [2021-03-25 14:33:00,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:33:00,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:33:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 572 transitions. [2021-03-25 14:33:00,009 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8951486697965572 [2021-03-25 14:33:00,009 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 572 transitions. [2021-03-25 14:33:00,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 572 transitions. [2021-03-25 14:33:00,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:00,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 572 transitions. [2021-03-25 14:33:00,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:00,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:00,013 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:00,013 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 89 flow. Second operand 3 states and 572 transitions. [2021-03-25 14:33:00,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 97 flow [2021-03-25 14:33:00,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 90 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:00,014 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 93 flow [2021-03-25 14:33:00,014 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2021-03-25 14:33:00,015 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -18 predicate places. [2021-03-25 14:33:00,015 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:00,015 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 93 flow [2021-03-25 14:33:00,016 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 93 flow [2021-03-25 14:33:00,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 93 flow [2021-03-25 14:33:00,021 INFO L129 PetriNetUnfolder]: 2/36 cut-off events. [2021-03-25 14:33:00,022 INFO L130 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2021-03-25 14:33:00,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 36 events. 2/36 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 52. Up to 8 conditions per place. [2021-03-25 14:33:00,023 INFO L142 LiptonReduction]: Number of co-enabled transitions 454 [2021-03-25 14:33:00,358 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 14:33:00,510 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 14:33:00,835 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 14:33:00,994 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 14:33:00,997 INFO L154 LiptonReduction]: Checked pairs total: 1000 [2021-03-25 14:33:00,997 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:33:00,998 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 983 [2021-03-25 14:33:00,998 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 91 flow [2021-03-25 14:33:00,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:00,999 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:00,999 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:00,999 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:33:00,999 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:00,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:00,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1292657167, now seen corresponding path program 1 times [2021-03-25 14:33:01,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:01,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473344479] [2021-03-25 14:33:01,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:01,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:01,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:01,047 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:33:01,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:01,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:01,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:33:01,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473344479] [2021-03-25 14:33:01,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:01,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:33:01,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813804570] [2021-03-25 14:33:01,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:33:01,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:01,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:33:01,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:33:01,056 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 214 [2021-03-25 14:33:01,057 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:01,057 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:01,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 214 [2021-03-25 14:33:01,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:01,128 INFO L129 PetriNetUnfolder]: 160/302 cut-off events. [2021-03-25 14:33:01,128 INFO L130 PetriNetUnfolder]: For 24/40 co-relation queries the response was YES. [2021-03-25 14:33:01,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 302 events. 160/302 cut-off events. For 24/40 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1559 event pairs, 77 based on Foata normal form. 20/278 useless extension candidates. Maximal degree in co-relation 614. Up to 208 conditions per place. [2021-03-25 14:33:01,131 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 11 selfloop transitions, 9 changer transitions 2/44 dead transitions. [2021-03-25 14:33:01,131 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 163 flow [2021-03-25 14:33:01,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:33:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:33:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 919 transitions. [2021-03-25 14:33:01,134 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8588785046728972 [2021-03-25 14:33:01,134 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 919 transitions. [2021-03-25 14:33:01,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 919 transitions. [2021-03-25 14:33:01,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:01,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 919 transitions. [2021-03-25 14:33:01,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:01,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:01,139 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:01,139 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 91 flow. Second operand 5 states and 919 transitions. [2021-03-25 14:33:01,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 163 flow [2021-03-25 14:33:01,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 157 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:01,142 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 154 flow [2021-03-25 14:33:01,142 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-25 14:33:01,142 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -14 predicate places. [2021-03-25 14:33:01,142 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:01,143 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 154 flow [2021-03-25 14:33:01,143 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 154 flow [2021-03-25 14:33:01,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 154 flow [2021-03-25 14:33:01,169 INFO L129 PetriNetUnfolder]: 117/239 cut-off events. [2021-03-25 14:33:01,170 INFO L130 PetriNetUnfolder]: For 146/175 co-relation queries the response was YES. [2021-03-25 14:33:01,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 239 events. 117/239 cut-off events. For 146/175 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1201 event pairs, 56 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 651. Up to 163 conditions per place. [2021-03-25 14:33:01,173 INFO L142 LiptonReduction]: Number of co-enabled transitions 624 [2021-03-25 14:33:01,181 INFO L154 LiptonReduction]: Checked pairs total: 1158 [2021-03-25 14:33:01,181 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:33:01,182 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-03-25 14:33:01,183 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 148 flow [2021-03-25 14:33:01,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:01,184 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:01,184 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:01,184 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:33:01,184 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:01,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:01,185 INFO L82 PathProgramCache]: Analyzing trace with hash -733019417, now seen corresponding path program 1 times [2021-03-25 14:33:01,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:01,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250236632] [2021-03-25 14:33:01,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:01,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:01,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:01,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:01,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:01,324 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:33:01,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:01,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:01,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:33:01,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250236632] [2021-03-25 14:33:01,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:01,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:33:01,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839968477] [2021-03-25 14:33:01,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:33:01,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:01,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:33:01,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:33:01,338 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 214 [2021-03-25 14:33:01,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:01,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:01,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 214 [2021-03-25 14:33:01,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:01,430 INFO L129 PetriNetUnfolder]: 125/249 cut-off events. [2021-03-25 14:33:01,430 INFO L130 PetriNetUnfolder]: For 182/338 co-relation queries the response was YES. [2021-03-25 14:33:01,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 249 events. 125/249 cut-off events. For 182/338 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1086 event pairs, 17 based on Foata normal form. 30/263 useless extension candidates. Maximal degree in co-relation 852. Up to 173 conditions per place. [2021-03-25 14:33:01,432 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 12 selfloop transitions, 13 changer transitions 2/49 dead transitions. [2021-03-25 14:33:01,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 264 flow [2021-03-25 14:33:01,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:33:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:33:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1103 transitions. [2021-03-25 14:33:01,435 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8590342679127726 [2021-03-25 14:33:01,435 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1103 transitions. [2021-03-25 14:33:01,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1103 transitions. [2021-03-25 14:33:01,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:01,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1103 transitions. [2021-03-25 14:33:01,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 183.83333333333334) internal successors, (1103), 6 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:01,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:01,442 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:01,442 INFO L185 Difference]: Start difference. First operand has 47 places, 37 transitions, 148 flow. Second operand 6 states and 1103 transitions. [2021-03-25 14:33:01,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 264 flow [2021-03-25 14:33:01,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 257 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:01,446 INFO L241 Difference]: Finished difference. Result has 51 places, 42 transitions, 233 flow [2021-03-25 14:33:01,447 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2021-03-25 14:33:01,447 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -10 predicate places. [2021-03-25 14:33:01,447 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:01,447 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 233 flow [2021-03-25 14:33:01,447 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 42 transitions, 233 flow [2021-03-25 14:33:01,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 233 flow [2021-03-25 14:33:01,463 INFO L129 PetriNetUnfolder]: 82/187 cut-off events. [2021-03-25 14:33:01,463 INFO L130 PetriNetUnfolder]: For 333/384 co-relation queries the response was YES. [2021-03-25 14:33:01,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 187 events. 82/187 cut-off events. For 333/384 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 893 event pairs, 16 based on Foata normal form. 4/182 useless extension candidates. Maximal degree in co-relation 746. Up to 130 conditions per place. [2021-03-25 14:33:01,466 INFO L142 LiptonReduction]: Number of co-enabled transitions 716 [2021-03-25 14:33:01,475 INFO L154 LiptonReduction]: Checked pairs total: 1213 [2021-03-25 14:33:01,475 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:33:01,475 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-25 14:33:01,476 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 225 flow [2021-03-25 14:33:01,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:01,477 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:01,477 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:01,477 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:33:01,477 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:01,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:01,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2130465503, now seen corresponding path program 1 times [2021-03-25 14:33:01,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:01,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383293100] [2021-03-25 14:33:01,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:01,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:01,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:01,614 INFO L142 QuantifierPusher]: treesize reduction 5, result has 86.5 percent of original size [2021-03-25 14:33:01,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 14:33:01,635 INFO L142 QuantifierPusher]: treesize reduction 21, result has 64.4 percent of original size [2021-03-25 14:33:01,636 INFO L147 QuantifierPusher]: treesize reduction 8, result has 78.9 percent of original size 30 [2021-03-25 14:33:01,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:01,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:33:01,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383293100] [2021-03-25 14:33:01,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:01,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:33:01,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216051137] [2021-03-25 14:33:01,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:33:01,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:01,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:33:01,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:33:01,661 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 214 [2021-03-25 14:33:01,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 164.16666666666666) internal successors, (985), 6 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:01,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:01,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 214 [2021-03-25 14:33:01,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:01,956 INFO L129 PetriNetUnfolder]: 586/1177 cut-off events. [2021-03-25 14:33:01,956 INFO L130 PetriNetUnfolder]: For 2557/3115 co-relation queries the response was YES. [2021-03-25 14:33:01,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4265 conditions, 1177 events. 586/1177 cut-off events. For 2557/3115 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 7461 event pairs, 79 based on Foata normal form. 68/1186 useless extension candidates. Maximal degree in co-relation 4247. Up to 566 conditions per place. [2021-03-25 14:33:01,969 INFO L132 encePairwiseOnDemand]: 205/214 looper letters, 19 selfloop transitions, 17 changer transitions 0/65 dead transitions. [2021-03-25 14:33:01,969 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 363 flow [2021-03-25 14:33:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:33:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:33:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1179 transitions. [2021-03-25 14:33:01,972 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7870493991989319 [2021-03-25 14:33:01,972 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1179 transitions. [2021-03-25 14:33:01,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1179 transitions. [2021-03-25 14:33:01,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:01,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1179 transitions. [2021-03-25 14:33:01,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.42857142857142) internal successors, (1179), 7 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:01,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:01,977 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:01,977 INFO L185 Difference]: Start difference. First operand has 51 places, 41 transitions, 225 flow. Second operand 7 states and 1179 transitions. [2021-03-25 14:33:01,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 363 flow [2021-03-25 14:33:01,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 305 flow, removed 24 selfloop flow, removed 4 redundant places. [2021-03-25 14:33:02,000 INFO L241 Difference]: Finished difference. Result has 55 places, 53 transitions, 283 flow [2021-03-25 14:33:02,000 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=283, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2021-03-25 14:33:02,000 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2021-03-25 14:33:02,000 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:02,001 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 53 transitions, 283 flow [2021-03-25 14:33:02,001 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 53 transitions, 283 flow [2021-03-25 14:33:02,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 53 transitions, 283 flow [2021-03-25 14:33:02,108 INFO L129 PetriNetUnfolder]: 505/1019 cut-off events. [2021-03-25 14:33:02,109 INFO L130 PetriNetUnfolder]: For 1653/1955 co-relation queries the response was YES. [2021-03-25 14:33:02,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 1019 events. 505/1019 cut-off events. For 1653/1955 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 6599 event pairs, 156 based on Foata normal form. 32/969 useless extension candidates. Maximal degree in co-relation 3494. Up to 450 conditions per place. [2021-03-25 14:33:02,122 INFO L142 LiptonReduction]: Number of co-enabled transitions 970 [2021-03-25 14:33:02,416 INFO L154 LiptonReduction]: Checked pairs total: 266 [2021-03-25 14:33:02,416 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:02,416 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 416 [2021-03-25 14:33:02,419 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 283 flow [2021-03-25 14:33:02,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 164.16666666666666) internal successors, (985), 6 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:02,420 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:02,420 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:02,420 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:33:02,420 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:02,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:02,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1091012703, now seen corresponding path program 2 times [2021-03-25 14:33:02,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:02,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625390844] [2021-03-25 14:33:02,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:02,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:02,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:02,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:02,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:02,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:02,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:02,538 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:33:02,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:02,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:02,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:33:02,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625390844] [2021-03-25 14:33:02,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:02,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:33:02,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960520362] [2021-03-25 14:33:02,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:33:02,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:02,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:33:02,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:33:02,552 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 214 [2021-03-25 14:33:02,553 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 179.83333333333334) internal successors, (1079), 6 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:02,553 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:02,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 214 [2021-03-25 14:33:02,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:02,739 INFO L129 PetriNetUnfolder]: 624/1238 cut-off events. [2021-03-25 14:33:02,739 INFO L130 PetriNetUnfolder]: For 2657/4440 co-relation queries the response was YES. [2021-03-25 14:33:02,746 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4460 conditions, 1238 events. 624/1238 cut-off events. For 2657/4440 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 8138 event pairs, 50 based on Foata normal form. 386/1466 useless extension candidates. Maximal degree in co-relation 4440. Up to 661 conditions per place. [2021-03-25 14:33:02,752 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 12 selfloop transitions, 18 changer transitions 5/69 dead transitions. [2021-03-25 14:33:02,752 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 461 flow [2021-03-25 14:33:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:33:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:33:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1287 transitions. [2021-03-25 14:33:02,756 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8591455273698264 [2021-03-25 14:33:02,756 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1287 transitions. [2021-03-25 14:33:02,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1287 transitions. [2021-03-25 14:33:02,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:02,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1287 transitions. [2021-03-25 14:33:02,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 183.85714285714286) internal successors, (1287), 7 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:02,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:02,764 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:02,764 INFO L185 Difference]: Start difference. First operand has 55 places, 53 transitions, 283 flow. Second operand 7 states and 1287 transitions. [2021-03-25 14:33:02,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 461 flow [2021-03-25 14:33:02,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 449 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:02,772 INFO L241 Difference]: Finished difference. Result has 62 places, 61 transitions, 409 flow [2021-03-25 14:33:02,773 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=409, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2021-03-25 14:33:02,773 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2021-03-25 14:33:02,773 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:02,773 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 61 transitions, 409 flow [2021-03-25 14:33:02,773 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 61 transitions, 409 flow [2021-03-25 14:33:02,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 61 transitions, 409 flow [2021-03-25 14:33:02,838 INFO L129 PetriNetUnfolder]: 301/705 cut-off events. [2021-03-25 14:33:02,838 INFO L130 PetriNetUnfolder]: For 1928/2269 co-relation queries the response was YES. [2021-03-25 14:33:02,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2917 conditions, 705 events. 301/705 cut-off events. For 1928/2269 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4600 event pairs, 52 based on Foata normal form. 10/673 useless extension candidates. Maximal degree in co-relation 2896. Up to 398 conditions per place. [2021-03-25 14:33:02,849 INFO L142 LiptonReduction]: Number of co-enabled transitions 1082 [2021-03-25 14:33:02,882 INFO L154 LiptonReduction]: Checked pairs total: 338 [2021-03-25 14:33:02,882 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:02,883 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 110 [2021-03-25 14:33:02,883 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 409 flow [2021-03-25 14:33:02,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 179.83333333333334) internal successors, (1079), 6 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:02,884 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:02,884 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-25 14:33:02,884 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:33:02,884 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:02,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:02,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1546745988, now seen corresponding path program 1 times [2021-03-25 14:33:02,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:02,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270329973] [2021-03-25 14:33:02,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:02,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:02,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:02,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:02,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:02,988 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:33:02,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:33:03,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-25 14:33:03,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270329973] [2021-03-25 14:33:03,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:03,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:33:03,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236921762] [2021-03-25 14:33:03,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:33:03,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:03,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:33:03,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:33:03,002 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 214 [2021-03-25 14:33:03,003 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 409 flow. Second operand has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:03,003 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:03,003 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 214 [2021-03-25 14:33:03,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:03,296 INFO L129 PetriNetUnfolder]: 957/2184 cut-off events. [2021-03-25 14:33:03,296 INFO L130 PetriNetUnfolder]: For 5214/5763 co-relation queries the response was YES. [2021-03-25 14:33:03,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8499 conditions, 2184 events. 957/2184 cut-off events. For 5214/5763 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 17569 event pairs, 82 based on Foata normal form. 63/2120 useless extension candidates. Maximal degree in co-relation 8476. Up to 999 conditions per place. [2021-03-25 14:33:03,320 INFO L132 encePairwiseOnDemand]: 205/214 looper letters, 18 selfloop transitions, 19 changer transitions 1/87 dead transitions. [2021-03-25 14:33:03,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 603 flow [2021-03-25 14:33:03,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:33:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:33:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 849 transitions. [2021-03-25 14:33:03,323 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7934579439252336 [2021-03-25 14:33:03,323 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 849 transitions. [2021-03-25 14:33:03,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 849 transitions. [2021-03-25 14:33:03,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:03,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 849 transitions. [2021-03-25 14:33:03,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:03,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:03,327 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:03,327 INFO L185 Difference]: Start difference. First operand has 62 places, 61 transitions, 409 flow. Second operand 5 states and 849 transitions. [2021-03-25 14:33:03,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 603 flow [2021-03-25 14:33:03,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 538 flow, removed 26 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:03,399 INFO L241 Difference]: Finished difference. Result has 68 places, 78 transitions, 526 flow [2021-03-25 14:33:03,399 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=526, PETRI_PLACES=68, PETRI_TRANSITIONS=78} [2021-03-25 14:33:03,399 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2021-03-25 14:33:03,399 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:03,399 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 78 transitions, 526 flow [2021-03-25 14:33:03,399 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 78 transitions, 526 flow [2021-03-25 14:33:03,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 78 transitions, 526 flow [2021-03-25 14:33:03,626 INFO L129 PetriNetUnfolder]: 953/2215 cut-off events. [2021-03-25 14:33:03,626 INFO L130 PetriNetUnfolder]: For 3731/3943 co-relation queries the response was YES. [2021-03-25 14:33:03,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7370 conditions, 2215 events. 953/2215 cut-off events. For 3731/3943 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18151 event pairs, 127 based on Foata normal form. 27/2140 useless extension candidates. Maximal degree in co-relation 7344. Up to 559 conditions per place. [2021-03-25 14:33:03,664 INFO L142 LiptonReduction]: Number of co-enabled transitions 1560 [2021-03-25 14:33:03,685 INFO L154 LiptonReduction]: Checked pairs total: 188 [2021-03-25 14:33:03,685 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:03,686 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 287 [2021-03-25 14:33:03,686 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 78 transitions, 526 flow [2021-03-25 14:33:03,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:03,686 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:03,687 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, 1] [2021-03-25 14:33:03,687 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:33:03,687 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:03,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:03,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2096613610, now seen corresponding path program 1 times [2021-03-25 14:33:03,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:03,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178718235] [2021-03-25 14:33:03,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:03,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:03,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:03,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:03,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:03,748 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:33:03,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:33:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:33:03,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178718235] [2021-03-25 14:33:03,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:03,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:33:03,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310888755] [2021-03-25 14:33:03,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:33:03,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:03,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:33:03,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:33:03,763 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 214 [2021-03-25 14:33:03,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 78 transitions, 526 flow. Second operand has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:03,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:03,763 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 214 [2021-03-25 14:33:03,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:04,055 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L788-->L795: Formula: (let ((.cse12 (= (mod v_~b$w_buff0_used~0_474 256) 0)) (.cse14 (= (mod v_~b$w_buff1_used~0_378 256) 0)) (.cse3 (= (mod v_~b$r_buff1_thd2~0_52 256) 0)) (.cse13 (= (mod v_~b$r_buff0_thd2~0_64 256) 0)) (.cse0 (= (mod v_~b$w_buff0_used~0_473 256) 0))) (let ((.cse7 (or .cse13 .cse0)) (.cse10 (or .cse14 .cse3)) (.cse5 (not .cse0)) (.cse11 (not .cse14)) (.cse4 (not .cse3)) (.cse9 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse8 (not .cse12))) (and (let ((.cse2 (= (mod v_~b$w_buff1_used~0_377 256) 0)) (.cse1 (= (mod v_~b$r_buff0_thd2~0_63 256) 0))) (or (and (= v_~b$r_buff1_thd2~0_52 v_~b$r_buff1_thd2~0_51) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) .cse4) (and .cse5 (not .cse1))) (= v_~b$r_buff1_thd2~0_51 0)))) (or (and .cse5 .cse6 (= v_~b$r_buff0_thd2~0_63 0)) (and .cse7 (= v_~b$r_buff0_thd2~0_64 v_~b$r_buff0_thd2~0_63))) (or (and .cse6 (= v_~b~0_162 v_~b$w_buff0~0_87) (= |v_P1_#t~ite11_43| |v_P1Thread1of1ForFork2_#t~ite11_1|) .cse8) (and (= |v_P1_#t~ite11_43| v_~b~0_162) .cse9 (or (and (= |v_P1_#t~ite11_43| v_~b~0_163) .cse10) (and .cse11 .cse4 (= v_~b$w_buff1~0_108 |v_P1_#t~ite11_43|))))) (or (and (= v_~b$w_buff1_used~0_378 v_~b$w_buff1_used~0_377) .cse7 .cse10) (and (or (and .cse5 .cse6) (and .cse11 .cse4)) (= v_~b$w_buff1_used~0_377 0))) (or (and .cse9 (= v_~b$w_buff0_used~0_474 v_~b$w_buff0_used~0_473)) (and .cse6 (= v_~b$w_buff0_used~0_473 0) .cse8))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_474, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_64, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_378, ~b~0=v_~b~0_163, ~b$w_buff1~0=v_~b$w_buff1~0_108, ~b$w_buff0~0=v_~b$w_buff0~0_87, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_1|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_52} OutVars{~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_63, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_2|, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_1|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_1|, P1Thread1of1ForFork2_#t~ite15=|v_P1Thread1of1ForFork2_#t~ite15_1|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_473, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_377, ~b~0=v_~b~0_162, ~b$w_buff1~0=v_~b$w_buff1~0_108, ~b$w_buff0~0=v_~b$w_buff0~0_87, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_51} AuxVars[|v_P1_#t~ite11_43|] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11, P1Thread1of1ForFork2_#t~ite14, ~b$r_buff1_thd2~0, P1Thread1of1ForFork2_#t~ite13, P1Thread1of1ForFork2_#t~ite16, P1Thread1of1ForFork2_#t~ite15][19], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, Black: 192#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 194#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 191#(<= ~__unbuffered_cnt~0 2), P0Thread1of1ForFork1InUse, 201#(= ~x~0 1), 78#L854true, Black: 199#true, Black: 202#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 204#(and (= ~x~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 141#(= ~z~0 0), 215#(and (= ~y~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 88#L878-1true, 28#L815true, 30#L795true, Black: 158#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 166#(<= ~__unbuffered_cnt~0 1), 51#L768true, Black: 177#(and (= ~b$w_buff0~0 1) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd1~0) (= ~b$w_buff0_used~0 1)), Black: 178#(and (= ~b$w_buff0_used~0 (* 256 (div ~b$w_buff0_used~0 256))) (= ~b~0 1)), Black: 179#(= ~__unbuffered_p3_EBX~0 1), Black: 181#(and (= ~b$w_buff0_used~0 (* 256 (div ~b$w_buff0_used~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), 189#(= ~__unbuffered_cnt~0 0)]) [2021-03-25 14:33:04,056 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 14:33:04,056 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:33:04,056 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:33:04,056 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:33:04,080 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L788-->L795: Formula: (let ((.cse12 (= (mod v_~b$w_buff0_used~0_474 256) 0)) (.cse14 (= (mod v_~b$w_buff1_used~0_378 256) 0)) (.cse3 (= (mod v_~b$r_buff1_thd2~0_52 256) 0)) (.cse13 (= (mod v_~b$r_buff0_thd2~0_64 256) 0)) (.cse0 (= (mod v_~b$w_buff0_used~0_473 256) 0))) (let ((.cse7 (or .cse13 .cse0)) (.cse10 (or .cse14 .cse3)) (.cse5 (not .cse0)) (.cse11 (not .cse14)) (.cse4 (not .cse3)) (.cse9 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse8 (not .cse12))) (and (let ((.cse2 (= (mod v_~b$w_buff1_used~0_377 256) 0)) (.cse1 (= (mod v_~b$r_buff0_thd2~0_63 256) 0))) (or (and (= v_~b$r_buff1_thd2~0_52 v_~b$r_buff1_thd2~0_51) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) .cse4) (and .cse5 (not .cse1))) (= v_~b$r_buff1_thd2~0_51 0)))) (or (and .cse5 .cse6 (= v_~b$r_buff0_thd2~0_63 0)) (and .cse7 (= v_~b$r_buff0_thd2~0_64 v_~b$r_buff0_thd2~0_63))) (or (and .cse6 (= v_~b~0_162 v_~b$w_buff0~0_87) (= |v_P1_#t~ite11_43| |v_P1Thread1of1ForFork2_#t~ite11_1|) .cse8) (and (= |v_P1_#t~ite11_43| v_~b~0_162) .cse9 (or (and (= |v_P1_#t~ite11_43| v_~b~0_163) .cse10) (and .cse11 .cse4 (= v_~b$w_buff1~0_108 |v_P1_#t~ite11_43|))))) (or (and (= v_~b$w_buff1_used~0_378 v_~b$w_buff1_used~0_377) .cse7 .cse10) (and (or (and .cse5 .cse6) (and .cse11 .cse4)) (= v_~b$w_buff1_used~0_377 0))) (or (and .cse9 (= v_~b$w_buff0_used~0_474 v_~b$w_buff0_used~0_473)) (and .cse6 (= v_~b$w_buff0_used~0_473 0) .cse8))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_474, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_64, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_378, ~b~0=v_~b~0_163, ~b$w_buff1~0=v_~b$w_buff1~0_108, ~b$w_buff0~0=v_~b$w_buff0~0_87, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_1|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_52} OutVars{~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_63, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_2|, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_1|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_1|, P1Thread1of1ForFork2_#t~ite15=|v_P1Thread1of1ForFork2_#t~ite15_1|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_473, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_377, ~b~0=v_~b~0_162, ~b$w_buff1~0=v_~b$w_buff1~0_108, ~b$w_buff0~0=v_~b$w_buff0~0_87, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_51} AuxVars[|v_P1_#t~ite11_43|] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11, P1Thread1of1ForFork2_#t~ite14, ~b$r_buff1_thd2~0, P1Thread1of1ForFork2_#t~ite13, P1Thread1of1ForFork2_#t~ite16, P1Thread1of1ForFork2_#t~ite15][19], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, Black: 192#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 194#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 191#(<= ~__unbuffered_cnt~0 2), P0Thread1of1ForFork1InUse, 201#(= ~x~0 1), Black: 199#true, 78#L854true, Black: 202#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 204#(and (= ~x~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 141#(= ~z~0 0), 215#(and (= ~y~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 88#L878-1true, 28#L815true, 30#L795true, Black: 158#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 166#(<= ~__unbuffered_cnt~0 1), 114#L775true, Black: 177#(and (= ~b$w_buff0~0 1) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd1~0) (= ~b$w_buff0_used~0 1)), Black: 178#(and (= ~b$w_buff0_used~0 (* 256 (div ~b$w_buff0_used~0 256))) (= ~b~0 1)), Black: 179#(= ~__unbuffered_p3_EBX~0 1), Black: 181#(and (= ~b$w_buff0_used~0 (* 256 (div ~b$w_buff0_used~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), 189#(= ~__unbuffered_cnt~0 0)]) [2021-03-25 14:33:04,081 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 14:33:04,082 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 14:33:04,082 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 14:33:04,082 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 14:33:04,187 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L788-->L795: Formula: (let ((.cse12 (= (mod v_~b$w_buff0_used~0_474 256) 0)) (.cse14 (= (mod v_~b$w_buff1_used~0_378 256) 0)) (.cse3 (= (mod v_~b$r_buff1_thd2~0_52 256) 0)) (.cse13 (= (mod v_~b$r_buff0_thd2~0_64 256) 0)) (.cse0 (= (mod v_~b$w_buff0_used~0_473 256) 0))) (let ((.cse7 (or .cse13 .cse0)) (.cse10 (or .cse14 .cse3)) (.cse5 (not .cse0)) (.cse11 (not .cse14)) (.cse4 (not .cse3)) (.cse9 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse8 (not .cse12))) (and (let ((.cse2 (= (mod v_~b$w_buff1_used~0_377 256) 0)) (.cse1 (= (mod v_~b$r_buff0_thd2~0_63 256) 0))) (or (and (= v_~b$r_buff1_thd2~0_52 v_~b$r_buff1_thd2~0_51) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) .cse4) (and .cse5 (not .cse1))) (= v_~b$r_buff1_thd2~0_51 0)))) (or (and .cse5 .cse6 (= v_~b$r_buff0_thd2~0_63 0)) (and .cse7 (= v_~b$r_buff0_thd2~0_64 v_~b$r_buff0_thd2~0_63))) (or (and .cse6 (= v_~b~0_162 v_~b$w_buff0~0_87) (= |v_P1_#t~ite11_43| |v_P1Thread1of1ForFork2_#t~ite11_1|) .cse8) (and (= |v_P1_#t~ite11_43| v_~b~0_162) .cse9 (or (and (= |v_P1_#t~ite11_43| v_~b~0_163) .cse10) (and .cse11 .cse4 (= v_~b$w_buff1~0_108 |v_P1_#t~ite11_43|))))) (or (and (= v_~b$w_buff1_used~0_378 v_~b$w_buff1_used~0_377) .cse7 .cse10) (and (or (and .cse5 .cse6) (and .cse11 .cse4)) (= v_~b$w_buff1_used~0_377 0))) (or (and .cse9 (= v_~b$w_buff0_used~0_474 v_~b$w_buff0_used~0_473)) (and .cse6 (= v_~b$w_buff0_used~0_473 0) .cse8))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_474, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_64, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_378, ~b~0=v_~b~0_163, ~b$w_buff1~0=v_~b$w_buff1~0_108, ~b$w_buff0~0=v_~b$w_buff0~0_87, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_1|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_52} OutVars{~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_63, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_2|, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_1|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_1|, P1Thread1of1ForFork2_#t~ite15=|v_P1Thread1of1ForFork2_#t~ite15_1|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_473, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_377, ~b~0=v_~b~0_162, ~b$w_buff1~0=v_~b$w_buff1~0_108, ~b$w_buff0~0=v_~b$w_buff0~0_87, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_51} AuxVars[|v_P1_#t~ite11_43|] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11, P1Thread1of1ForFork2_#t~ite14, ~b$r_buff1_thd2~0, P1Thread1of1ForFork2_#t~ite13, P1Thread1of1ForFork2_#t~ite16, P1Thread1of1ForFork2_#t~ite15][19], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, Black: 192#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 194#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 191#(<= ~__unbuffered_cnt~0 2), P0Thread1of1ForFork1InUse, 201#(= ~x~0 1), Black: 199#true, Black: 202#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 80#P3EXITtrue, Black: 204#(and (= ~x~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 141#(= ~z~0 0), 86#L889true, 215#(and (= ~y~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 30#L795true, Black: 155#(= ~__unbuffered_cnt~0 0), Black: 158#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 166#(<= ~__unbuffered_cnt~0 1), 53#P2EXITtrue, Black: 177#(and (= ~b$w_buff0~0 1) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd1~0) (= ~b$w_buff0_used~0 1)), Black: 178#(and (= ~b$w_buff0_used~0 (* 256 (div ~b$w_buff0_used~0 256))) (= ~b~0 1)), Black: 179#(= ~__unbuffered_p3_EBX~0 1), Black: 181#(and (= ~b$w_buff0_used~0 (* 256 (div ~b$w_buff0_used~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), 59#P0EXITtrue, 187#true]) [2021-03-25 14:33:04,188 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-25 14:33:04,188 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:33:04,188 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:33:04,188 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:33:04,207 INFO L129 PetriNetUnfolder]: 1411/3137 cut-off events. [2021-03-25 14:33:04,207 INFO L130 PetriNetUnfolder]: For 6469/7074 co-relation queries the response was YES. [2021-03-25 14:33:04,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11051 conditions, 3137 events. 1411/3137 cut-off events. For 6469/7074 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 26335 event pairs, 140 based on Foata normal form. 100/3048 useless extension candidates. Maximal degree in co-relation 11023. Up to 850 conditions per place. [2021-03-25 14:33:04,245 INFO L132 encePairwiseOnDemand]: 205/214 looper letters, 30 selfloop transitions, 33 changer transitions 0/113 dead transitions. [2021-03-25 14:33:04,245 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 113 transitions, 934 flow [2021-03-25 14:33:04,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:33:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:33:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 845 transitions. [2021-03-25 14:33:04,247 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7897196261682243 [2021-03-25 14:33:04,248 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 845 transitions. [2021-03-25 14:33:04,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 845 transitions. [2021-03-25 14:33:04,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:04,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 845 transitions. [2021-03-25 14:33:04,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:04,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:04,253 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:04,253 INFO L185 Difference]: Start difference. First operand has 68 places, 78 transitions, 526 flow. Second operand 5 states and 845 transitions. [2021-03-25 14:33:04,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 113 transitions, 934 flow [2021-03-25 14:33:04,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 113 transitions, 932 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-25 14:33:04,328 INFO L241 Difference]: Finished difference. Result has 75 places, 101 transitions, 867 flow [2021-03-25 14:33:04,328 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=867, PETRI_PLACES=75, PETRI_TRANSITIONS=101} [2021-03-25 14:33:04,329 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2021-03-25 14:33:04,329 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:04,329 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 101 transitions, 867 flow [2021-03-25 14:33:04,329 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 101 transitions, 867 flow [2021-03-25 14:33:04,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 101 transitions, 867 flow [2021-03-25 14:33:04,702 INFO L129 PetriNetUnfolder]: 1416/3264 cut-off events. [2021-03-25 14:33:04,702 INFO L130 PetriNetUnfolder]: For 7068/7459 co-relation queries the response was YES. [2021-03-25 14:33:04,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11740 conditions, 3264 events. 1416/3264 cut-off events. For 7068/7459 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 28567 event pairs, 164 based on Foata normal form. 108/3228 useless extension candidates. Maximal degree in co-relation 11709. Up to 844 conditions per place. [2021-03-25 14:33:04,756 INFO L142 LiptonReduction]: Number of co-enabled transitions 2034 [2021-03-25 14:33:05,080 INFO L154 LiptonReduction]: Checked pairs total: 90 [2021-03-25 14:33:05,081 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:33:05,081 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 752 [2021-03-25 14:33:05,081 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 101 transitions, 871 flow [2021-03-25 14:33:05,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:05,082 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:05,082 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, 1] [2021-03-25 14:33:05,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:33:05,082 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:05,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:05,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1035001816, now seen corresponding path program 2 times [2021-03-25 14:33:05,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:05,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782092313] [2021-03-25 14:33:05,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:05,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:05,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:05,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:05,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:05,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:05,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:05,140 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:33:05,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:33:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:33:05,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782092313] [2021-03-25 14:33:05,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:05,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:33:05,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645492443] [2021-03-25 14:33:05,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:33:05,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:05,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:33:05,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:33:05,155 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 216 [2021-03-25 14:33:05,155 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 101 transitions, 871 flow. Second operand has 5 states, 5 states have (on average 165.4) internal successors, (827), 5 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:05,155 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:05,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 216 [2021-03-25 14:33:05,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:05,767 INFO L129 PetriNetUnfolder]: 1990/4484 cut-off events. [2021-03-25 14:33:05,767 INFO L130 PetriNetUnfolder]: For 11098/12386 co-relation queries the response was YES. [2021-03-25 14:33:05,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16828 conditions, 4484 events. 1990/4484 cut-off events. For 11098/12386 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 41134 event pairs, 201 based on Foata normal form. 239/4464 useless extension candidates. Maximal degree in co-relation 16795. Up to 1182 conditions per place. [2021-03-25 14:33:05,814 INFO L132 encePairwiseOnDemand]: 205/216 looper letters, 36 selfloop transitions, 26 changer transitions 17/128 dead transitions. [2021-03-25 14:33:05,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 128 transitions, 1341 flow [2021-03-25 14:33:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:33:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:33:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1019 transitions. [2021-03-25 14:33:05,817 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7862654320987654 [2021-03-25 14:33:05,817 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1019 transitions. [2021-03-25 14:33:05,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1019 transitions. [2021-03-25 14:33:05,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:05,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1019 transitions. [2021-03-25 14:33:05,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:05,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:05,822 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:05,822 INFO L185 Difference]: Start difference. First operand has 75 places, 101 transitions, 871 flow. Second operand 6 states and 1019 transitions. [2021-03-25 14:33:05,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 128 transitions, 1341 flow [2021-03-25 14:33:05,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 128 transitions, 1339 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-25 14:33:05,946 INFO L241 Difference]: Finished difference. Result has 83 places, 99 transitions, 937 flow [2021-03-25 14:33:05,946 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=937, PETRI_PLACES=83, PETRI_TRANSITIONS=99} [2021-03-25 14:33:05,946 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 22 predicate places. [2021-03-25 14:33:05,947 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:05,947 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 99 transitions, 937 flow [2021-03-25 14:33:05,947 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 99 transitions, 937 flow [2021-03-25 14:33:05,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 99 transitions, 937 flow [2021-03-25 14:33:06,427 INFO L129 PetriNetUnfolder]: 1939/4486 cut-off events. [2021-03-25 14:33:06,427 INFO L130 PetriNetUnfolder]: For 11179/11756 co-relation queries the response was YES. [2021-03-25 14:33:06,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16488 conditions, 4486 events. 1939/4486 cut-off events. For 11179/11756 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 42181 event pairs, 264 based on Foata normal form. 147/4412 useless extension candidates. Maximal degree in co-relation 16452. Up to 1162 conditions per place. [2021-03-25 14:33:06,491 INFO L142 LiptonReduction]: Number of co-enabled transitions 2096 [2021-03-25 14:33:06,600 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:33:06,600 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:06,600 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 654 [2021-03-25 14:33:06,601 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 99 transitions, 937 flow [2021-03-25 14:33:06,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.4) internal successors, (827), 5 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:06,601 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:06,601 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-25 14:33:06,601 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:33:06,602 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:06,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:06,602 INFO L82 PathProgramCache]: Analyzing trace with hash 344294779, now seen corresponding path program 1 times [2021-03-25 14:33:06,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:06,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54292604] [2021-03-25 14:33:06,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:06,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:06,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:33:06,709 INFO L142 QuantifierPusher]: treesize reduction 4, result has 90.7 percent of original size [2021-03-25 14:33:06,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 14:33:06,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:06,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 14:33:06,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:06,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 14:33:06,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:06,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:33:06,788 INFO L142 QuantifierPusher]: treesize reduction 4, result has 84.0 percent of original size [2021-03-25 14:33:06,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:33:06,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:06,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:33:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:33:06,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54292604] [2021-03-25 14:33:06,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:06,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 14:33:06,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828322023] [2021-03-25 14:33:06,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 14:33:06,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:06,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 14:33:06,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-25 14:33:06,820 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 216 [2021-03-25 14:33:06,821 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 99 transitions, 937 flow. Second operand has 9 states, 9 states have (on average 155.88888888888889) internal successors, (1403), 9 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:06,821 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:06,821 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 216 [2021-03-25 14:33:06,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:07,721 INFO L129 PetriNetUnfolder]: 2795/6386 cut-off events. [2021-03-25 14:33:07,721 INFO L130 PetriNetUnfolder]: For 19278/21527 co-relation queries the response was YES. [2021-03-25 14:33:07,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25100 conditions, 6386 events. 2795/6386 cut-off events. For 19278/21527 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 63623 event pairs, 111 based on Foata normal form. 550/6612 useless extension candidates. Maximal degree in co-relation 25062. Up to 1753 conditions per place. [2021-03-25 14:33:07,777 INFO L132 encePairwiseOnDemand]: 207/216 looper letters, 40 selfloop transitions, 22 changer transitions 2/130 dead transitions. [2021-03-25 14:33:07,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 130 transitions, 1411 flow [2021-03-25 14:33:07,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:33:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:33:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1122 transitions. [2021-03-25 14:33:07,781 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7420634920634921 [2021-03-25 14:33:07,781 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1122 transitions. [2021-03-25 14:33:07,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1122 transitions. [2021-03-25 14:33:07,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:07,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1122 transitions. [2021-03-25 14:33:07,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.28571428571428) internal successors, (1122), 7 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:07,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:07,787 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:07,787 INFO L185 Difference]: Start difference. First operand has 83 places, 99 transitions, 937 flow. Second operand 7 states and 1122 transitions. [2021-03-25 14:33:07,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 130 transitions, 1411 flow [2021-03-25 14:33:08,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 130 transitions, 1385 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:08,058 INFO L241 Difference]: Finished difference. Result has 91 places, 111 transitions, 1139 flow [2021-03-25 14:33:08,059 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1139, PETRI_PLACES=91, PETRI_TRANSITIONS=111} [2021-03-25 14:33:08,059 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 30 predicate places. [2021-03-25 14:33:08,059 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:08,059 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 111 transitions, 1139 flow [2021-03-25 14:33:08,059 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 111 transitions, 1139 flow [2021-03-25 14:33:08,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 111 transitions, 1139 flow [2021-03-25 14:33:08,581 INFO L129 PetriNetUnfolder]: 2791/6420 cut-off events. [2021-03-25 14:33:08,581 INFO L130 PetriNetUnfolder]: For 21957/23097 co-relation queries the response was YES. [2021-03-25 14:33:08,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25439 conditions, 6420 events. 2791/6420 cut-off events. For 21957/23097 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 64530 event pairs, 275 based on Foata normal form. 274/6394 useless extension candidates. Maximal degree in co-relation 25399. Up to 1781 conditions per place. [2021-03-25 14:33:08,661 INFO L142 LiptonReduction]: Number of co-enabled transitions 2460 [2021-03-25 14:33:08,939 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:33:08,939 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:08,939 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 880 [2021-03-25 14:33:08,939 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 111 transitions, 1139 flow [2021-03-25 14:33:08,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 155.88888888888889) internal successors, (1403), 9 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:08,940 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:08,940 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-25 14:33:08,940 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:33:08,940 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:08,940 INFO L82 PathProgramCache]: Analyzing trace with hash 674201615, now seen corresponding path program 1 times [2021-03-25 14:33:08,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:08,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005501715] [2021-03-25 14:33:08,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:09,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:09,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:33:09,022 INFO L142 QuantifierPusher]: treesize reduction 5, result has 90.0 percent of original size [2021-03-25 14:33:09,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 14:33:09,054 INFO L142 QuantifierPusher]: treesize reduction 27, result has 72.2 percent of original size [2021-03-25 14:33:09,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-03-25 14:33:09,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:09,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:33:09,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:09,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:33:09,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005501715] [2021-03-25 14:33:09,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:09,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:33:09,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739257281] [2021-03-25 14:33:09,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:33:09,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:09,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:33:09,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:33:09,109 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 216 [2021-03-25 14:33:09,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 111 transitions, 1139 flow. Second operand has 7 states, 7 states have (on average 157.14285714285714) internal successors, (1100), 7 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:09,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:09,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 216 [2021-03-25 14:33:09,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:09,970 INFO L129 PetriNetUnfolder]: 3300/7425 cut-off events. [2021-03-25 14:33:09,971 INFO L130 PetriNetUnfolder]: For 31838/35046 co-relation queries the response was YES. [2021-03-25 14:33:10,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31241 conditions, 7425 events. 3300/7425 cut-off events. For 31838/35046 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 75512 event pairs, 136 based on Foata normal form. 749/7786 useless extension candidates. Maximal degree in co-relation 31199. Up to 2164 conditions per place. [2021-03-25 14:33:10,029 INFO L132 encePairwiseOnDemand]: 208/216 looper letters, 51 selfloop transitions, 28 changer transitions 4/149 dead transitions. [2021-03-25 14:33:10,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 149 transitions, 1833 flow [2021-03-25 14:33:10,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:33:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:33:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1129 transitions. [2021-03-25 14:33:10,032 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7466931216931217 [2021-03-25 14:33:10,032 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1129 transitions. [2021-03-25 14:33:10,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1129 transitions. [2021-03-25 14:33:10,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:10,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1129 transitions. [2021-03-25 14:33:10,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 161.28571428571428) internal successors, (1129), 7 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:10,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:10,037 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:10,037 INFO L185 Difference]: Start difference. First operand has 91 places, 111 transitions, 1139 flow. Second operand 7 states and 1129 transitions. [2021-03-25 14:33:10,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 149 transitions, 1833 flow [2021-03-25 14:33:10,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 149 transitions, 1833 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:33:10,395 INFO L241 Difference]: Finished difference. Result has 101 places, 128 transitions, 1504 flow [2021-03-25 14:33:10,395 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1504, PETRI_PLACES=101, PETRI_TRANSITIONS=128} [2021-03-25 14:33:10,396 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 40 predicate places. [2021-03-25 14:33:10,396 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:10,396 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 128 transitions, 1504 flow [2021-03-25 14:33:10,396 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 128 transitions, 1504 flow [2021-03-25 14:33:10,397 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 128 transitions, 1504 flow [2021-03-25 14:33:11,004 INFO L129 PetriNetUnfolder]: 3271/7447 cut-off events. [2021-03-25 14:33:11,004 INFO L130 PetriNetUnfolder]: For 31523/33099 co-relation queries the response was YES. [2021-03-25 14:33:11,043 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30868 conditions, 7447 events. 3271/7447 cut-off events. For 31523/33099 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 77022 event pairs, 276 based on Foata normal form. 379/7517 useless extension candidates. Maximal degree in co-relation 30822. Up to 2177 conditions per place. [2021-03-25 14:33:11,120 INFO L142 LiptonReduction]: Number of co-enabled transitions 2706 [2021-03-25 14:33:11,905 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:33:12,028 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:33:12,663 INFO L154 LiptonReduction]: Checked pairs total: 8 [2021-03-25 14:33:12,663 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:33:12,664 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2268 [2021-03-25 14:33:12,664 INFO L480 AbstractCegarLoop]: Abstraction has has 101 places, 128 transitions, 1522 flow [2021-03-25 14:33:12,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 157.14285714285714) internal successors, (1100), 7 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:12,665 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:12,665 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-25 14:33:12,665 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:33:12,665 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:12,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:12,665 INFO L82 PathProgramCache]: Analyzing trace with hash -480223429, now seen corresponding path program 2 times [2021-03-25 14:33:12,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:12,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445859683] [2021-03-25 14:33:12,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:12,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:12,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:33:12,749 INFO L142 QuantifierPusher]: treesize reduction 2, result has 90.5 percent of original size [2021-03-25 14:33:12,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:33:12,761 INFO L142 QuantifierPusher]: treesize reduction 7, result has 80.6 percent of original size [2021-03-25 14:33:12,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:33:12,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:12,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:33:12,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:12,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:33:12,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445859683] [2021-03-25 14:33:12,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:12,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:33:12,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146142964] [2021-03-25 14:33:12,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:33:12,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:12,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:33:12,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:33:12,803 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 217 [2021-03-25 14:33:12,815 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 128 transitions, 1522 flow. Second operand has 7 states, 7 states have (on average 161.14285714285714) internal successors, (1128), 7 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-25 14:33:12,815 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:12,815 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 217 [2021-03-25 14:33:12,815 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:13,784 INFO L129 PetriNetUnfolder]: 3747/8412 cut-off events. [2021-03-25 14:33:13,784 INFO L130 PetriNetUnfolder]: For 43495/47423 co-relation queries the response was YES. [2021-03-25 14:33:13,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36609 conditions, 8412 events. 3747/8412 cut-off events. For 43495/47423 co-relation queries the response was YES. Maximal size of possible extension queue 1080. Compared 87025 event pairs, 179 based on Foata normal form. 920/8892 useless extension candidates. Maximal degree in co-relation 36561. Up to 2541 conditions per place. [2021-03-25 14:33:13,862 INFO L132 encePairwiseOnDemand]: 208/217 looper letters, 52 selfloop transitions, 33 changer transitions 7/158 dead transitions. [2021-03-25 14:33:13,863 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 158 transitions, 2149 flow [2021-03-25 14:33:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:33:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:33:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1151 transitions. [2021-03-25 14:33:13,865 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7577353522053983 [2021-03-25 14:33:13,866 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1151 transitions. [2021-03-25 14:33:13,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1151 transitions. [2021-03-25 14:33:13,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:13,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1151 transitions. [2021-03-25 14:33:13,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 164.42857142857142) internal successors, (1151), 7 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:13,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:13,871 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:13,871 INFO L185 Difference]: Start difference. First operand has 101 places, 128 transitions, 1522 flow. Second operand 7 states and 1151 transitions. [2021-03-25 14:33:13,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 158 transitions, 2149 flow [2021-03-25 14:33:14,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 158 transitions, 2111 flow, removed 19 selfloop flow, removed 0 redundant places. [2021-03-25 14:33:14,361 INFO L241 Difference]: Finished difference. Result has 111 places, 142 transitions, 1835 flow [2021-03-25 14:33:14,361 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1835, PETRI_PLACES=111, PETRI_TRANSITIONS=142} [2021-03-25 14:33:14,361 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 50 predicate places. [2021-03-25 14:33:14,361 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:14,362 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 142 transitions, 1835 flow [2021-03-25 14:33:14,362 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 142 transitions, 1835 flow [2021-03-25 14:33:14,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 142 transitions, 1835 flow [2021-03-25 14:33:15,075 INFO L129 PetriNetUnfolder]: 3730/8438 cut-off events. [2021-03-25 14:33:15,076 INFO L130 PetriNetUnfolder]: For 41902/43941 co-relation queries the response was YES. [2021-03-25 14:33:15,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36163 conditions, 8438 events. 3730/8438 cut-off events. For 41902/43941 co-relation queries the response was YES. Maximal size of possible extension queue 1044. Compared 88401 event pairs, 245 based on Foata normal form. 485/8512 useless extension candidates. Maximal degree in co-relation 36111. Up to 2548 conditions per place. [2021-03-25 14:33:15,230 INFO L142 LiptonReduction]: Number of co-enabled transitions 2982 [2021-03-25 14:33:16,023 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:33:16,023 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:16,023 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1662 [2021-03-25 14:33:16,024 INFO L480 AbstractCegarLoop]: Abstraction has has 111 places, 142 transitions, 1835 flow [2021-03-25 14:33:16,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 161.14285714285714) internal successors, (1128), 7 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-25 14:33:16,024 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:16,024 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-25 14:33:16,024 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:33:16,024 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:16,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:16,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1215546201, now seen corresponding path program 3 times [2021-03-25 14:33:16,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:16,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998858610] [2021-03-25 14:33:16,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:16,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:16,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:16,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:16,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:16,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:16,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:16,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:16,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:16,106 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:33:16,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:16,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:16,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:33:16,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998858610] [2021-03-25 14:33:16,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:16,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:33:16,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659807704] [2021-03-25 14:33:16,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:33:16,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:16,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:33:16,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:33:16,117 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 217 [2021-03-25 14:33:16,117 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 142 transitions, 1835 flow. Second operand has 7 states, 7 states have (on average 181.85714285714286) internal successors, (1273), 7 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:16,117 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:16,117 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 217 [2021-03-25 14:33:16,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:17,946 INFO L129 PetriNetUnfolder]: 6881/13226 cut-off events. [2021-03-25 14:33:17,946 INFO L130 PetriNetUnfolder]: For 59516/76508 co-relation queries the response was YES. [2021-03-25 14:33:18,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55364 conditions, 13226 events. 6881/13226 cut-off events. For 59516/76508 co-relation queries the response was YES. Maximal size of possible extension queue 1922. Compared 130526 event pairs, 171 based on Foata normal form. 3109/14604 useless extension candidates. Maximal degree in co-relation 55310. Up to 4284 conditions per place. [2021-03-25 14:33:18,054 INFO L132 encePairwiseOnDemand]: 209/217 looper letters, 8 selfloop transitions, 23 changer transitions 13/143 dead transitions. [2021-03-25 14:33:18,054 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 143 transitions, 1841 flow [2021-03-25 14:33:18,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:33:18,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:33:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1666 transitions. [2021-03-25 14:33:18,058 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8530465949820788 [2021-03-25 14:33:18,058 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1666 transitions. [2021-03-25 14:33:18,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1666 transitions. [2021-03-25 14:33:18,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:18,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1666 transitions. [2021-03-25 14:33:18,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 185.11111111111111) internal successors, (1666), 9 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:18,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:18,064 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:18,064 INFO L185 Difference]: Start difference. First operand has 111 places, 142 transitions, 1835 flow. Second operand 9 states and 1666 transitions. [2021-03-25 14:33:18,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 143 transitions, 1841 flow [2021-03-25 14:33:18,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 143 transitions, 1796 flow, removed 16 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:18,968 INFO L241 Difference]: Finished difference. Result has 120 places, 127 transitions, 1575 flow [2021-03-25 14:33:18,968 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1575, PETRI_PLACES=120, PETRI_TRANSITIONS=127} [2021-03-25 14:33:18,968 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 59 predicate places. [2021-03-25 14:33:18,968 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:18,968 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 127 transitions, 1575 flow [2021-03-25 14:33:18,968 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 127 transitions, 1575 flow [2021-03-25 14:33:18,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 127 transitions, 1575 flow [2021-03-25 14:33:19,647 INFO L129 PetriNetUnfolder]: 3197/7667 cut-off events. [2021-03-25 14:33:19,647 INFO L130 PetriNetUnfolder]: For 31540/33644 co-relation queries the response was YES. [2021-03-25 14:33:19,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36117 conditions, 7667 events. 3197/7667 cut-off events. For 31540/33644 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 83864 event pairs, 158 based on Foata normal form. 390/7705 useless extension candidates. Maximal degree in co-relation 36062. Up to 2278 conditions per place. [2021-03-25 14:33:19,787 INFO L142 LiptonReduction]: Number of co-enabled transitions 2796 [2021-03-25 14:33:20,086 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-25 14:33:20,221 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:33:20,436 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:33:20,759 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:33:20,891 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:33:21,152 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:33:21,296 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:33:21,360 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:33:21,361 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:33:21,361 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2393 [2021-03-25 14:33:21,361 INFO L480 AbstractCegarLoop]: Abstraction has has 118 places, 126 transitions, 1601 flow [2021-03-25 14:33:21,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 181.85714285714286) internal successors, (1273), 7 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:21,362 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:21,362 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, 1, 1, 1] [2021-03-25 14:33:21,362 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:33:21,362 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:21,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1588390040, now seen corresponding path program 1 times [2021-03-25 14:33:21,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:21,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807473221] [2021-03-25 14:33:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:21,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:21,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:21,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:21,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:21,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:21,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:33:21,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807473221] [2021-03-25 14:33:21,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:21,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:33:21,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722357372] [2021-03-25 14:33:21,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:33:21,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:21,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:33:21,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:33:21,418 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 220 [2021-03-25 14:33:21,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 126 transitions, 1601 flow. Second operand has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:21,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:21,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 220 [2021-03-25 14:33:21,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:22,671 INFO L129 PetriNetUnfolder]: 4718/11111 cut-off events. [2021-03-25 14:33:22,671 INFO L130 PetriNetUnfolder]: For 43892/47772 co-relation queries the response was YES. [2021-03-25 14:33:22,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51981 conditions, 11111 events. 4718/11111 cut-off events. For 43892/47772 co-relation queries the response was YES. Maximal size of possible extension queue 1679. Compared 126098 event pairs, 248 based on Foata normal form. 410/10833 useless extension candidates. Maximal degree in co-relation 51924. Up to 3479 conditions per place. [2021-03-25 14:33:22,737 INFO L132 encePairwiseOnDemand]: 215/220 looper letters, 3 selfloop transitions, 2 changer transitions 47/125 dead transitions. [2021-03-25 14:33:22,737 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 125 transitions, 1559 flow [2021-03-25 14:33:22,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:33:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:33:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 740 transitions. [2021-03-25 14:33:22,739 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8409090909090909 [2021-03-25 14:33:22,739 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 740 transitions. [2021-03-25 14:33:22,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 740 transitions. [2021-03-25 14:33:22,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:22,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 740 transitions. [2021-03-25 14:33:22,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:22,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:22,743 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:22,743 INFO L185 Difference]: Start difference. First operand has 118 places, 126 transitions, 1601 flow. Second operand 4 states and 740 transitions. [2021-03-25 14:33:22,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 125 transitions, 1559 flow [2021-03-25 14:33:24,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 125 transitions, 1457 flow, removed 21 selfloop flow, removed 13 redundant places. [2021-03-25 14:33:24,030 INFO L241 Difference]: Finished difference. Result has 109 places, 78 transitions, 825 flow [2021-03-25 14:33:24,030 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=825, PETRI_PLACES=109, PETRI_TRANSITIONS=78} [2021-03-25 14:33:24,030 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 48 predicate places. [2021-03-25 14:33:24,030 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:24,031 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 78 transitions, 825 flow [2021-03-25 14:33:24,031 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 78 transitions, 825 flow [2021-03-25 14:33:24,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 78 transitions, 825 flow [2021-03-25 14:33:24,142 INFO L129 PetriNetUnfolder]: 456/1167 cut-off events. [2021-03-25 14:33:24,143 INFO L130 PetriNetUnfolder]: For 4156/4569 co-relation queries the response was YES. [2021-03-25 14:33:24,147 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4798 conditions, 1167 events. 456/1167 cut-off events. For 4156/4569 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 9167 event pairs, 42 based on Foata normal form. 64/1174 useless extension candidates. Maximal degree in co-relation 4751. Up to 263 conditions per place. [2021-03-25 14:33:24,154 INFO L142 LiptonReduction]: Number of co-enabled transitions 984 [2021-03-25 14:33:25,016 WARN L205 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2021-03-25 14:33:25,371 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-25 14:33:27,498 WARN L205 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-25 14:33:28,385 WARN L205 SmtUtils]: Spent 883.00 ms on a formula simplification that was a NOOP. DAG size: 305 [2021-03-25 14:33:29,369 WARN L205 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-25 14:33:30,196 WARN L205 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 203 [2021-03-25 14:33:32,608 WARN L205 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 377 DAG size of output: 316 [2021-03-25 14:33:33,560 WARN L205 SmtUtils]: Spent 948.00 ms on a formula simplification that was a NOOP. DAG size: 307 [2021-03-25 14:33:34,584 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2021-03-25 14:33:35,035 WARN L205 SmtUtils]: Spent 447.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-25 14:33:37,476 WARN L205 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 377 DAG size of output: 316 [2021-03-25 14:33:38,511 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 307 [2021-03-25 14:33:38,869 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:33:39,048 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:33:39,063 INFO L154 LiptonReduction]: Checked pairs total: 104 [2021-03-25 14:33:39,063 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 14:33:39,063 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15033 [2021-03-25 14:33:39,064 INFO L480 AbstractCegarLoop]: Abstraction has has 104 places, 75 transitions, 817 flow [2021-03-25 14:33:39,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:39,064 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:39,064 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, 1, 1] [2021-03-25 14:33:39,064 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 14:33:39,064 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:39,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:39,065 INFO L82 PathProgramCache]: Analyzing trace with hash 367732412, now seen corresponding path program 1 times [2021-03-25 14:33:39,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:39,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435594866] [2021-03-25 14:33:39,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:39,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:39,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:33:39,175 INFO L142 QuantifierPusher]: treesize reduction 5, result has 89.6 percent of original size [2021-03-25 14:33:39,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-25 14:33:39,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:39,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 14:33:39,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:39,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:33:39,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:39,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:33:39,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:39,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:33:39,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435594866] [2021-03-25 14:33:39,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:39,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:33:39,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707333380] [2021-03-25 14:33:39,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:33:39,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:39,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:33:39,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:33:39,278 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 224 [2021-03-25 14:33:39,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 75 transitions, 817 flow. Second operand has 8 states, 8 states have (on average 157.0) internal successors, (1256), 8 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:39,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:39,282 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 224 [2021-03-25 14:33:39,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:39,617 INFO L129 PetriNetUnfolder]: 372/856 cut-off events. [2021-03-25 14:33:39,617 INFO L130 PetriNetUnfolder]: For 6027/6883 co-relation queries the response was YES. [2021-03-25 14:33:39,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3914 conditions, 856 events. 372/856 cut-off events. For 6027/6883 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5853 event pairs, 15 based on Foata normal form. 202/1005 useless extension candidates. Maximal degree in co-relation 3865. Up to 244 conditions per place. [2021-03-25 14:33:39,622 INFO L132 encePairwiseOnDemand]: 215/224 looper letters, 23 selfloop transitions, 17 changer transitions 3/78 dead transitions. [2021-03-25 14:33:39,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 78 transitions, 983 flow [2021-03-25 14:33:39,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:33:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:33:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 958 transitions. [2021-03-25 14:33:39,624 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7127976190476191 [2021-03-25 14:33:39,625 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 958 transitions. [2021-03-25 14:33:39,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 958 transitions. [2021-03-25 14:33:39,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:39,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 958 transitions. [2021-03-25 14:33:39,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 159.66666666666666) internal successors, (958), 6 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:39,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:39,629 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:39,629 INFO L185 Difference]: Start difference. First operand has 104 places, 75 transitions, 817 flow. Second operand 6 states and 958 transitions. [2021-03-25 14:33:39,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 78 transitions, 983 flow [2021-03-25 14:33:39,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 78 transitions, 863 flow, removed 29 selfloop flow, removed 15 redundant places. [2021-03-25 14:33:39,650 INFO L241 Difference]: Finished difference. Result has 92 places, 73 transitions, 773 flow [2021-03-25 14:33:39,650 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=773, PETRI_PLACES=92, PETRI_TRANSITIONS=73} [2021-03-25 14:33:39,650 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 31 predicate places. [2021-03-25 14:33:39,650 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:39,650 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 73 transitions, 773 flow [2021-03-25 14:33:39,650 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 73 transitions, 773 flow [2021-03-25 14:33:39,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 92 places, 73 transitions, 773 flow [2021-03-25 14:33:39,713 INFO L129 PetriNetUnfolder]: 372/854 cut-off events. [2021-03-25 14:33:39,714 INFO L130 PetriNetUnfolder]: For 3284/3633 co-relation queries the response was YES. [2021-03-25 14:33:39,717 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3460 conditions, 854 events. 372/854 cut-off events. For 3284/3633 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5873 event pairs, 38 based on Foata normal form. 71/878 useless extension candidates. Maximal degree in co-relation 3423. Up to 244 conditions per place. [2021-03-25 14:33:39,722 INFO L142 LiptonReduction]: Number of co-enabled transitions 838 [2021-03-25 14:33:41,027 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-25 14:33:41,476 WARN L205 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2021-03-25 14:33:43,823 WARN L205 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-25 14:33:44,831 WARN L205 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 305 [2021-03-25 14:33:46,142 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-25 14:33:47,101 WARN L205 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 203 [2021-03-25 14:33:49,736 WARN L205 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 377 DAG size of output: 318 [2021-03-25 14:33:50,921 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 307 [2021-03-25 14:33:50,934 INFO L154 LiptonReduction]: Checked pairs total: 30 [2021-03-25 14:33:50,934 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:33:50,935 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11285 [2021-03-25 14:33:50,936 INFO L480 AbstractCegarLoop]: Abstraction has has 92 places, 73 transitions, 773 flow [2021-03-25 14:33:50,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 157.0) internal successors, (1256), 8 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:50,936 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:50,936 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, 1] [2021-03-25 14:33:50,936 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 14:33:50,936 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:50,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1038867487, now seen corresponding path program 1 times [2021-03-25 14:33:50,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:50,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278407646] [2021-03-25 14:33:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:33:50,989 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:33:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:33:51,043 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:33:51,072 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:33:51,072 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:33:51,072 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 14:33:51,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:33:51 BasicIcfg [2021-03-25 14:33:51,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:33:51,188 INFO L168 Benchmark]: Toolchain (without parser) took 60235.02 ms. Allocated memory was 255.9 MB in the beginning and 4.7 GB in the end (delta: 4.5 GB). Free memory was 232.3 MB in the beginning and 3.7 GB in the end (delta: -3.5 GB). Peak memory consumption was 1.0 GB. Max. memory is 16.0 GB. [2021-03-25 14:33:51,188 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:33:51,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 570.40 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 231.7 MB in the beginning and 336.9 MB in the end (delta: -105.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-03-25 14:33:51,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.39 ms. Allocated memory is still 377.5 MB. Free memory was 336.9 MB in the beginning and 334.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:33:51,188 INFO L168 Benchmark]: Boogie Preprocessor took 60.24 ms. Allocated memory is still 377.5 MB. Free memory was 334.1 MB in the beginning and 332.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:33:51,189 INFO L168 Benchmark]: RCFGBuilder took 1773.81 ms. Allocated memory is still 377.5 MB. Free memory was 332.0 MB in the beginning and 291.7 MB in the end (delta: 40.3 MB). Peak memory consumption was 63.0 MB. Max. memory is 16.0 GB. [2021-03-25 14:33:51,189 INFO L168 Benchmark]: TraceAbstraction took 57756.39 ms. Allocated memory was 377.5 MB in the beginning and 4.7 GB in the end (delta: 4.4 GB). Free memory was 291.7 MB in the beginning and 3.7 GB in the end (delta: -3.4 GB). Peak memory consumption was 970.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:33:51,194 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 570.40 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 231.7 MB in the beginning and 336.9 MB in the end (delta: -105.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 68.39 ms. Allocated memory is still 377.5 MB. Free memory was 336.9 MB in the beginning and 334.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 60.24 ms. Allocated memory is still 377.5 MB. Free memory was 334.1 MB in the beginning and 332.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1773.81 ms. Allocated memory is still 377.5 MB. Free memory was 332.0 MB in the beginning and 291.7 MB in the end (delta: 40.3 MB). Peak memory consumption was 63.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 57756.39 ms. Allocated memory was 377.5 MB in the beginning and 4.7 GB in the end (delta: 4.4 GB). Free memory was 291.7 MB in the beginning and 3.7 GB in the end (delta: -3.4 GB). Peak memory consumption was 970.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3692.4ms, 127 PlacesBefore, 61 PlacesAfterwards, 116 TransitionsBefore, 49 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 5194 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2703, positive: 2592, positive conditional: 0, positive unconditional: 2592, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1861, positive: 1808, positive conditional: 0, positive unconditional: 1808, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1861, positive: 1808, positive conditional: 0, positive unconditional: 1808, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1861, positive: 1791, positive conditional: 0, positive unconditional: 1791, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 721, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 674, negative conditional: 0, negative unconditional: 674, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2703, positive: 784, positive conditional: 0, positive unconditional: 784, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 1861, unknown conditional: 0, unknown unconditional: 1861] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 237, Positive conditional cache size: 0, Positive unconditional cache size: 237, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1130.7ms, 57 PlacesBefore, 45 PlacesAfterwards, 46 TransitionsBefore, 34 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 2761 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 945, positive: 821, positive conditional: 0, positive unconditional: 821, negative: 124, negative conditional: 0, negative unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 167, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 167, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 167, positive: 141, positive conditional: 0, positive unconditional: 141, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 230, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 201, negative conditional: 0, negative unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 945, positive: 673, positive conditional: 0, positive unconditional: 673, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 167, unknown conditional: 0, unknown unconditional: 167] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 272, Positive conditional cache size: 0, Positive unconditional cache size: 272, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 734.8ms, 49 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 31 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 1458 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 493, positive: 423, positive conditional: 0, positive unconditional: 423, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 493, positive: 416, positive conditional: 0, positive unconditional: 416, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 268, Positive conditional cache size: 0, Positive unconditional cache size: 268, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 981.9ms, 43 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1000 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 378, positive: 328, positive conditional: 0, positive unconditional: 328, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 378, positive: 325, positive conditional: 0, positive unconditional: 325, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 271, Positive conditional cache size: 0, Positive unconditional cache size: 271, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.6ms, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 624 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1158 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 381, positive: 337, positive conditional: 0, positive unconditional: 337, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 0, positive unconditional: 21, 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: 21, positive: 21, positive conditional: 0, positive unconditional: 21, 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: 21, positive: 21, positive conditional: 0, positive unconditional: 21, 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: 381, positive: 316, positive conditional: 0, positive unconditional: 316, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 272, Positive conditional cache size: 0, Positive unconditional cache size: 272, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.8ms, 51 PlacesBefore, 51 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 716 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1213 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 385, positive: 343, positive conditional: 0, positive unconditional: 343, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 385, positive: 324, positive conditional: 0, positive unconditional: 324, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 275, Positive conditional cache size: 0, Positive unconditional cache size: 275, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 415.0ms, 55 PlacesBefore, 55 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 970 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 266 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 153, positive: 146, positive conditional: 0, positive unconditional: 146, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 153, positive: 144, positive conditional: 0, positive unconditional: 144, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 307, Positive cache size: 277, Positive conditional cache size: 0, Positive unconditional cache size: 277, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 109.2ms, 62 PlacesBefore, 62 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 1082 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 338 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 179, positive: 170, positive conditional: 0, positive unconditional: 170, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, positive: 168, positive conditional: 0, positive unconditional: 168, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 279, Positive conditional cache size: 0, Positive unconditional cache size: 279, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 286.0ms, 68 PlacesBefore, 68 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 1560 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 188 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 279, Positive conditional cache size: 0, Positive unconditional cache size: 279, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 751.6ms, 75 PlacesBefore, 75 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 2034 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 90 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 90, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 276, Positive conditional cache size: 0, Positive unconditional cache size: 276, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 653.0ms, 83 PlacesBefore, 83 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 276, Positive conditional cache size: 0, Positive unconditional cache size: 276, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 879.8ms, 91 PlacesBefore, 91 PlacesAfterwards, 111 TransitionsBefore, 111 TransitionsAfterwards, 2460 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 276, Positive conditional cache size: 0, Positive unconditional cache size: 276, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2267.3ms, 101 PlacesBefore, 101 PlacesAfterwards, 128 TransitionsBefore, 128 TransitionsAfterwards, 2706 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 8 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 270, Positive conditional cache size: 0, Positive unconditional cache size: 270, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1661.4ms, 111 PlacesBefore, 111 PlacesAfterwards, 142 TransitionsBefore, 142 TransitionsAfterwards, 2982 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 270, Positive conditional cache size: 0, Positive unconditional cache size: 270, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2392.2ms, 120 PlacesBefore, 118 PlacesAfterwards, 127 TransitionsBefore, 126 TransitionsAfterwards, 2796 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 251, Positive conditional cache size: 0, Positive unconditional cache size: 251, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15032.4ms, 109 PlacesBefore, 104 PlacesAfterwards, 78 TransitionsBefore, 75 TransitionsAfterwards, 984 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 104 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 104, positive: 104, positive conditional: 0, positive unconditional: 104, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 273, Positive conditional cache size: 0, Positive unconditional cache size: 273, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11284.1ms, 92 PlacesBefore, 92 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 838 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 30 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 273, Positive conditional cache size: 0, Positive unconditional cache size: 273, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [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$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1129; [L872] FCALL, FORK 0 pthread_create(&t1129, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=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] [L873] 0 pthread_t t1130; [L874] FCALL, FORK 0 pthread_create(&t1130, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=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] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=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] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=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=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=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=0, z=0] [L875] 0 pthread_t t1131; [L876] FCALL, FORK 0 pthread_create(&t1131, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=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=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, 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_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=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] [L807] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, 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_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=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] [L877] 0 pthread_t t1132; [L878] FCALL, FORK 0 pthread_create(&t1132, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, 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_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=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] [L824] 4 z = 2 [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=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=2] [L790] 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) [L790] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L790] 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) [L790] 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) [L791] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L792] 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 [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L794] 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 [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L838] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L838] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L840] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L842] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=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=2] [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L770] 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) [L770] 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) [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L772] 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 [L773] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L774] 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 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L810] 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) [L810] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L810] 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) [L810] 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) [L811] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L812] 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 [L813] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L814] 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 [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] 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) [L884] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L884] 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) [L884] 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) [L885] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L886] 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 [L887] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L888] 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 [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 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: 57476.0ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 12700.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3795.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 116 SDtfs, 90 SDslu, 87 SDs, 0 SdLazy, 781 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 861.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 697.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1835occurred in iteration=13, InterpolantAutomatonStates: 92, 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: 55.1ms SsaConstructionTime, 635.5ms SatisfiabilityAnalysisTime, 1302.5ms InterpolantComputationTime, 353 NumberOfCodeBlocks, 353 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 2255 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...