/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:33:37,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:33:37,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:33:37,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:33:37,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:33:37,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:33:37,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:33:37,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:33:37,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:33:37,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:33:37,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:33:37,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:33:37,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:33:37,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:33:37,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:33:37,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:33:37,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:33:37,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:33:37,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:33:37,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:33:37,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:33:37,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:33:37,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:33:37,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:33:37,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:33:37,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:33:37,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:33:37,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:33:37,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:33:37,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:33:37,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:33:37,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:33:37,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:33:37,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:33:37,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:33:37,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:33:37,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:33:37,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:33:37,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:33:37,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:33:37,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:33:37,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:33:37,212 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:33:37,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:33:37,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:33:37,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:33:37,213 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:33:37,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:33:37,216 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:33:37,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:33:37,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:33:37,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:33:37,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:33:37,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:33:37,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:33:37,217 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:33:37,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:33:37,218 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:33:37,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:33:37,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:33:37,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:33:37,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:33:37,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:33:37,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:33:37,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:33:37,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:33:37,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:33:37,219 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:33:37,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:33:37,219 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:33:37,219 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:33:37,219 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:33:37,219 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:33:37,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:33:37,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:33:37,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:33:37,525 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:33:37,526 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:33:37,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2021-03-26 10:33:37,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce48c7d8b/f9914213d0154531801a42358df196e0/FLAG69d080873 [2021-03-26 10:33:37,994 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:33:37,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2021-03-26 10:33:38,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce48c7d8b/f9914213d0154531801a42358df196e0/FLAG69d080873 [2021-03-26 10:33:38,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce48c7d8b/f9914213d0154531801a42358df196e0 [2021-03-26 10:33:38,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:33:38,042 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:33:38,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:33:38,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:33:38,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:33:38,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:33:38" (1/1) ... [2021-03-26 10:33:38,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eccf52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:33:38, skipping insertion in model container [2021-03-26 10:33:38,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:33:38" (1/1) ... [2021-03-26 10:33:38,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:33:38,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:33:38,215 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/safe016_power.oepc.i[995,1008] [2021-03-26 10:33:38,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:33:38,356 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:33:38,363 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/safe016_power.oepc.i[995,1008] [2021-03-26 10:33:38,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:33:38,437 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:33:38,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:33:38 WrapperNode [2021-03-26 10:33:38,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:33:38,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:33:38,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:33:38,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:33:38,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:33:38" (1/1) ... [2021-03-26 10:33:38,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:33:38" (1/1) ... [2021-03-26 10:33:38,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:33:38,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:33:38,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:33:38,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:33:38,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:33:38" (1/1) ... [2021-03-26 10:33:38,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:33:38" (1/1) ... [2021-03-26 10:33:38,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:33:38" (1/1) ... [2021-03-26 10:33:38,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:33:38" (1/1) ... [2021-03-26 10:33:38,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:33:38" (1/1) ... [2021-03-26 10:33:38,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:33:38" (1/1) ... [2021-03-26 10:33:38,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:33:38" (1/1) ... [2021-03-26 10:33:38,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:33:38,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:33:38,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:33:38,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:33:38,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:33:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:33:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-26 10:33:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:33:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:33:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:33:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:33:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:33:38,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:33:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:33:38,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:33:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:33:38,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:33:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:33:38,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:33:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:33:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:33:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:33:38,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:33:38,710 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:33:40,983 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:33:40,983 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-26 10:33:40,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:33:40 BoogieIcfgContainer [2021-03-26 10:33:40,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:33:40,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:33:40,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:33:40,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:33:40,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:33:38" (1/3) ... [2021-03-26 10:33:40,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328c2d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:33:40, skipping insertion in model container [2021-03-26 10:33:40,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:33:38" (2/3) ... [2021-03-26 10:33:40,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328c2d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:33:40, skipping insertion in model container [2021-03-26 10:33:40,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:33:40" (3/3) ... [2021-03-26 10:33:40,989 INFO L111 eAbstractionObserver]: Analyzing ICFG safe016_power.oepc.i [2021-03-26 10:33:40,993 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:33:40,996 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-26 10:33:40,996 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:33:41,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,034 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,034 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,035 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,035 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,065 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,065 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,065 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,065 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,072 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,072 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,072 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,072 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,072 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,079 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,079 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,079 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,079 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,079 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,083 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,084 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,088 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,088 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,089 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,089 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,091 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,093 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,093 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,093 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:33:41,094 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:33:41,107 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 10:33:41,127 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:33:41,127 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:33:41,127 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:33:41,127 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:33:41,127 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:33:41,127 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:33:41,127 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:33:41,127 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:33:41,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2021-03-26 10:33:41,179 INFO L129 PetriNetUnfolder]: 2/124 cut-off events. [2021-03-26 10:33:41,179 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:33:41,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2021-03-26 10:33:41,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2021-03-26 10:33:41,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 110 transitions, 232 flow [2021-03-26 10:33:41,193 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:33:41,204 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 110 transitions, 232 flow [2021-03-26 10:33:41,206 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 110 transitions, 232 flow [2021-03-26 10:33:41,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 110 transitions, 232 flow [2021-03-26 10:33:41,236 INFO L129 PetriNetUnfolder]: 1/110 cut-off events. [2021-03-26 10:33:41,236 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:33:41,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2021-03-26 10:33:41,240 INFO L142 LiptonReduction]: Number of co-enabled transitions 1430 [2021-03-26 10:33:42,423 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 298 DAG size of output: 258 [2021-03-26 10:33:43,241 WARN L205 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 255 [2021-03-26 10:33:45,075 WARN L205 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 394 DAG size of output: 350 [2021-03-26 10:33:45,887 WARN L205 SmtUtils]: Spent 810.00 ms on a formula simplification that was a NOOP. DAG size: 347 [2021-03-26 10:33:48,553 WARN L205 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 406 DAG size of output: 364 [2021-03-26 10:33:49,389 WARN L205 SmtUtils]: Spent 833.00 ms on a formula simplification that was a NOOP. DAG size: 361 [2021-03-26 10:33:53,264 WARN L205 SmtUtils]: Spent 3.87 s on a formula simplification. DAG size of input: 566 DAG size of output: 532 [2021-03-26 10:33:54,970 WARN L205 SmtUtils]: Spent 1.70 s on a formula simplification that was a NOOP. DAG size: 528 [2021-03-26 10:33:56,476 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-26 10:33:56,901 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-03-26 10:33:57,040 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-26 10:34:02,238 WARN L205 SmtUtils]: Spent 607.00 ms on a formula simplification that was a NOOP. DAG size: 257 [2021-03-26 10:34:02,785 WARN L205 SmtUtils]: Spent 527.00 ms on a formula simplification that was a NOOP. DAG size: 257 [2021-03-26 10:34:03,913 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 349 [2021-03-26 10:34:04,901 WARN L205 SmtUtils]: Spent 985.00 ms on a formula simplification that was a NOOP. DAG size: 349 [2021-03-26 10:34:08,558 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 258 DAG size of output: 243 [2021-03-26 10:34:09,053 WARN L205 SmtUtils]: Spent 492.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2021-03-26 10:34:11,216 WARN L205 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 350 DAG size of output: 335 [2021-03-26 10:34:12,316 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 329 [2021-03-26 10:34:14,893 INFO L154 LiptonReduction]: Checked pairs total: 1852 [2021-03-26 10:34:14,894 INFO L156 LiptonReduction]: Total number of compositions: 69 [2021-03-26 10:34:14,895 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33703 [2021-03-26 10:34:14,909 INFO L129 PetriNetUnfolder]: 1/43 cut-off events. [2021-03-26 10:34:14,909 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:34:14,910 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:34:14,910 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, 1, 1, 1] [2021-03-26 10:34:14,910 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:34:14,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:34:14,915 INFO L82 PathProgramCache]: Analyzing trace with hash -310150407, now seen corresponding path program 1 times [2021-03-26 10:34:14,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:34:14,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897028860] [2021-03-26 10:34:14,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:34:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:34:15,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:15,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:34:15,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:15,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:34:15,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897028860] [2021-03-26 10:34:15,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:34:15,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:34:15,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942133345] [2021-03-26 10:34:15,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:34:15,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:34:15,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:34:15,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:34:15,175 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 197 [2021-03-26 10:34:15,179 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:15,179 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:34:15,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 197 [2021-03-26 10:34:15,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:34:15,215 INFO L129 PetriNetUnfolder]: 12/69 cut-off events. [2021-03-26 10:34:15,215 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:34:15,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 69 events. 12/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 2 based on Foata normal form. 4/66 useless extension candidates. Maximal degree in co-relation 80. Up to 25 conditions per place. [2021-03-26 10:34:15,217 INFO L132 encePairwiseOnDemand]: 192/197 looper letters, 5 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2021-03-26 10:34:15,217 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 118 flow [2021-03-26 10:34:15,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:34:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:34:15,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2021-03-26 10:34:15,232 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9272419627749577 [2021-03-26 10:34:15,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 548 transitions. [2021-03-26 10:34:15,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 548 transitions. [2021-03-26 10:34:15,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:34:15,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 548 transitions. [2021-03-26 10:34:15,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:15,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:15,255 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:15,256 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 548 transitions. [2021-03-26 10:34:15,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 118 flow [2021-03-26 10:34:15,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:34:15,260 INFO L241 Difference]: Finished difference. Result has 54 places, 44 transitions, 111 flow [2021-03-26 10:34:15,261 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2021-03-26 10:34:15,261 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2021-03-26 10:34:15,262 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:34:15,262 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 44 transitions, 111 flow [2021-03-26 10:34:15,262 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 44 transitions, 111 flow [2021-03-26 10:34:15,262 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 111 flow [2021-03-26 10:34:15,268 INFO L129 PetriNetUnfolder]: 3/50 cut-off events. [2021-03-26 10:34:15,268 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:34:15,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 50 events. 3/50 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 1 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-26 10:34:15,268 INFO L142 LiptonReduction]: Number of co-enabled transitions 320 [2021-03-26 10:34:19,132 INFO L154 LiptonReduction]: Checked pairs total: 759 [2021-03-26 10:34:19,132 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-26 10:34:19,132 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3871 [2021-03-26 10:34:19,133 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 85 flow [2021-03-26 10:34:19,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:19,134 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:34:19,134 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, 1, 1, 1, 1] [2021-03-26 10:34:19,134 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:34:19,134 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:34:19,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:34:19,134 INFO L82 PathProgramCache]: Analyzing trace with hash -215139068, now seen corresponding path program 1 times [2021-03-26 10:34:19,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:34:19,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274202119] [2021-03-26 10:34:19,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:34:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:34:19,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:19,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:34:19,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:19,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:19,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:19,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:34:19,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:19,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:34:19,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:19,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:34:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:34:19,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274202119] [2021-03-26 10:34:19,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:34:19,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:34:19,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927313488] [2021-03-26 10:34:19,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:34:19,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:34:19,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:34:19,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:34:19,350 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2021-03-26 10:34:19,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 85 flow. Second operand has 6 states, 6 states have (on average 156.83333333333334) internal successors, (941), 6 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:19,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:34:19,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2021-03-26 10:34:19,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:34:19,495 INFO L129 PetriNetUnfolder]: 149/310 cut-off events. [2021-03-26 10:34:19,495 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-03-26 10:34:19,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 310 events. 149/310 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1325 event pairs, 89 based on Foata normal form. 8/292 useless extension candidates. Maximal degree in co-relation 608. Up to 194 conditions per place. [2021-03-26 10:34:19,501 INFO L132 encePairwiseOnDemand]: 205/210 looper letters, 17 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2021-03-26 10:34:19,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 137 flow [2021-03-26 10:34:19,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:34:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:34:19,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 797 transitions. [2021-03-26 10:34:19,505 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7590476190476191 [2021-03-26 10:34:19,505 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 797 transitions. [2021-03-26 10:34:19,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 797 transitions. [2021-03-26 10:34:19,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:34:19,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 797 transitions. [2021-03-26 10:34:19,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.4) internal successors, (797), 5 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:19,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:19,510 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:19,510 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 85 flow. Second operand 5 states and 797 transitions. [2021-03-26 10:34:19,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 137 flow [2021-03-26 10:34:19,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:34:19,511 INFO L241 Difference]: Finished difference. Result has 45 places, 31 transitions, 94 flow [2021-03-26 10:34:19,512 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2021-03-26 10:34:19,512 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -11 predicate places. [2021-03-26 10:34:19,512 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:34:19,512 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 31 transitions, 94 flow [2021-03-26 10:34:19,513 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 31 transitions, 94 flow [2021-03-26 10:34:19,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 31 transitions, 94 flow [2021-03-26 10:34:19,517 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-26 10:34:19,518 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 10:34:19,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 37 events. 3/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-26 10:34:19,518 INFO L142 LiptonReduction]: Number of co-enabled transitions 318 [2021-03-26 10:34:20,541 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:34:20,669 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 10:34:20,800 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:34:20,919 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 10:34:21,812 WARN L205 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 165 [2021-03-26 10:34:22,231 WARN L205 SmtUtils]: Spent 416.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2021-03-26 10:34:23,171 WARN L205 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 165 [2021-03-26 10:34:23,610 WARN L205 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2021-03-26 10:34:23,614 INFO L154 LiptonReduction]: Checked pairs total: 948 [2021-03-26 10:34:23,614 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:34:23,615 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4103 [2021-03-26 10:34:23,615 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 80 flow [2021-03-26 10:34:23,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 156.83333333333334) internal successors, (941), 6 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:23,616 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:34:23,616 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:34:23,616 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:34:23,616 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:34:23,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:34:23,617 INFO L82 PathProgramCache]: Analyzing trace with hash -2041195495, now seen corresponding path program 1 times [2021-03-26 10:34:23,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:34:23,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970051076] [2021-03-26 10:34:23,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:34:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:34:23,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:23,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:23,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:23,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:34:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:34:23,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970051076] [2021-03-26 10:34:23,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:34:23,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:34:23,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169742897] [2021-03-26 10:34:23,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:34:23,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:34:23,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:34:23,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:34:23,745 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 215 [2021-03-26 10:34:23,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 193.75) internal successors, (775), 4 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:23,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:34:23,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 215 [2021-03-26 10:34:23,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:34:23,768 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-26 10:34:23,768 INFO L130 PetriNetUnfolder]: For 10/12 co-relation queries the response was YES. [2021-03-26 10:34:23,768 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 32 events. 3/32 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 1 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 54. Up to 10 conditions per place. [2021-03-26 10:34:23,769 INFO L132 encePairwiseOnDemand]: 212/215 looper letters, 1 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2021-03-26 10:34:23,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 26 transitions, 86 flow [2021-03-26 10:34:23,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:34:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:34:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 583 transitions. [2021-03-26 10:34:23,772 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9038759689922481 [2021-03-26 10:34:23,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 583 transitions. [2021-03-26 10:34:23,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 583 transitions. [2021-03-26 10:34:23,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:34:23,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 583 transitions. [2021-03-26 10:34:23,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:23,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:23,782 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:23,782 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 80 flow. Second operand 3 states and 583 transitions. [2021-03-26 10:34:23,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 26 transitions, 86 flow [2021-03-26 10:34:23,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 26 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:34:23,783 INFO L241 Difference]: Finished difference. Result has 39 places, 26 transitions, 84 flow [2021-03-26 10:34:23,783 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2021-03-26 10:34:23,783 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -17 predicate places. [2021-03-26 10:34:23,783 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:34:23,783 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 84 flow [2021-03-26 10:34:23,784 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 84 flow [2021-03-26 10:34:23,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 84 flow [2021-03-26 10:34:23,788 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-26 10:34:23,788 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-26 10:34:23,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 32 events. 3/32 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 54. Up to 10 conditions per place. [2021-03-26 10:34:23,789 INFO L142 LiptonReduction]: Number of co-enabled transitions 316 [2021-03-26 10:34:23,983 INFO L154 LiptonReduction]: Checked pairs total: 236 [2021-03-26 10:34:23,983 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:34:23,983 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 200 [2021-03-26 10:34:23,992 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 84 flow [2021-03-26 10:34:23,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 193.75) internal successors, (775), 4 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:23,993 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:34:23,993 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:34:23,993 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:34:23,994 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:34:23,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:34:23,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1252319268, now seen corresponding path program 1 times [2021-03-26 10:34:23,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:34:23,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859545953] [2021-03-26 10:34:23,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:34:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:34:24,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:24,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:34:24,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:24,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:34:24,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859545953] [2021-03-26 10:34:24,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:34:24,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:34:24,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638486573] [2021-03-26 10:34:24,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:34:24,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:34:24,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:34:24,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:34:24,054 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 215 [2021-03-26 10:34:24,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:24,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:34:24,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 215 [2021-03-26 10:34:24,055 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:34:24,085 INFO L129 PetriNetUnfolder]: 4/43 cut-off events. [2021-03-26 10:34:24,085 INFO L130 PetriNetUnfolder]: For 29/70 co-relation queries the response was YES. [2021-03-26 10:34:24,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 43 events. 4/43 cut-off events. For 29/70 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 2 based on Foata normal form. 1/41 useless extension candidates. Maximal degree in co-relation 85. Up to 12 conditions per place. [2021-03-26 10:34:24,086 INFO L132 encePairwiseOnDemand]: 212/215 looper letters, 5 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2021-03-26 10:34:24,086 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 27 transitions, 103 flow [2021-03-26 10:34:24,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:34:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:34:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions. [2021-03-26 10:34:24,088 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9100775193798449 [2021-03-26 10:34:24,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 587 transitions. [2021-03-26 10:34:24,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 587 transitions. [2021-03-26 10:34:24,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:34:24,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 587 transitions. [2021-03-26 10:34:24,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:24,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:24,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:24,091 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 84 flow. Second operand 3 states and 587 transitions. [2021-03-26 10:34:24,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 27 transitions, 103 flow [2021-03-26 10:34:24,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 27 transitions, 99 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:34:24,092 INFO L241 Difference]: Finished difference. Result has 40 places, 26 transitions, 91 flow [2021-03-26 10:34:24,092 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2021-03-26 10:34:24,092 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -16 predicate places. [2021-03-26 10:34:24,092 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:34:24,092 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 91 flow [2021-03-26 10:34:24,092 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 26 transitions, 91 flow [2021-03-26 10:34:24,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 26 transitions, 91 flow [2021-03-26 10:34:24,096 INFO L129 PetriNetUnfolder]: 0/31 cut-off events. [2021-03-26 10:34:24,096 INFO L130 PetriNetUnfolder]: For 26/32 co-relation queries the response was YES. [2021-03-26 10:34:24,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 31 events. 0/31 cut-off events. For 26/32 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2021-03-26 10:34:24,096 INFO L142 LiptonReduction]: Number of co-enabled transitions 316 [2021-03-26 10:34:29,753 INFO L154 LiptonReduction]: Checked pairs total: 274 [2021-03-26 10:34:29,753 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:34:29,753 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5661 [2021-03-26 10:34:29,754 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 91 flow [2021-03-26 10:34:29,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:29,754 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:34:29,754 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:34:29,755 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:34:29,755 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:34:29,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:34:29,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1987531963, now seen corresponding path program 1 times [2021-03-26 10:34:29,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:34:29,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721303363] [2021-03-26 10:34:29,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:34:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:34:29,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:29,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 10:34:29,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:29,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 10:34:29,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:29,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 10:34:29,994 INFO L142 QuantifierPusher]: treesize reduction 47, result has 35.6 percent of original size [2021-03-26 10:34:29,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 10:34:30,020 INFO L142 QuantifierPusher]: treesize reduction 47, result has 29.9 percent of original size [2021-03-26 10:34:30,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 10:34:30,044 INFO L142 QuantifierPusher]: treesize reduction 46, result has 23.3 percent of original size [2021-03-26 10:34:30,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:34:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:34:30,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721303363] [2021-03-26 10:34:30,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:34:30,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:34:30,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394313615] [2021-03-26 10:34:30,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:34:30,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:34:30,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:34:30,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:34:30,066 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 215 [2021-03-26 10:34:30,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 91 flow. Second operand has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:30,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:34:30,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 215 [2021-03-26 10:34:30,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:34:30,232 INFO L129 PetriNetUnfolder]: 78/208 cut-off events. [2021-03-26 10:34:30,232 INFO L130 PetriNetUnfolder]: For 230/278 co-relation queries the response was YES. [2021-03-26 10:34:30,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 208 events. 78/208 cut-off events. For 230/278 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 908 event pairs, 40 based on Foata normal form. 2/196 useless extension candidates. Maximal degree in co-relation 486. Up to 127 conditions per place. [2021-03-26 10:34:30,234 INFO L132 encePairwiseOnDemand]: 211/215 looper letters, 13 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-03-26 10:34:30,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 134 flow [2021-03-26 10:34:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:34:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:34:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2021-03-26 10:34:30,237 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6728682170542636 [2021-03-26 10:34:30,237 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2021-03-26 10:34:30,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2021-03-26 10:34:30,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:34:30,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2021-03-26 10:34:30,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:30,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:30,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:30,240 INFO L185 Difference]: Start difference. First operand has 40 places, 26 transitions, 91 flow. Second operand 3 states and 434 transitions. [2021-03-26 10:34:30,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 134 flow [2021-03-26 10:34:30,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 129 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:34:30,244 INFO L241 Difference]: Finished difference. Result has 42 places, 28 transitions, 105 flow [2021-03-26 10:34:30,244 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2021-03-26 10:34:30,244 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -14 predicate places. [2021-03-26 10:34:30,244 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:34:30,244 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 28 transitions, 105 flow [2021-03-26 10:34:30,244 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 28 transitions, 105 flow [2021-03-26 10:34:30,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 28 transitions, 105 flow [2021-03-26 10:34:30,251 INFO L129 PetriNetUnfolder]: 5/49 cut-off events. [2021-03-26 10:34:30,251 INFO L130 PetriNetUnfolder]: For 83/95 co-relation queries the response was YES. [2021-03-26 10:34:30,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 49 events. 5/49 cut-off events. For 83/95 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 130 event pairs, 2 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 105. Up to 15 conditions per place. [2021-03-26 10:34:30,252 INFO L142 LiptonReduction]: Number of co-enabled transitions 350 [2021-03-26 10:34:33,389 INFO L154 LiptonReduction]: Checked pairs total: 243 [2021-03-26 10:34:33,389 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:34:33,389 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3145 [2021-03-26 10:34:33,390 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 105 flow [2021-03-26 10:34:33,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:33,391 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:34:33,391 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:34:33,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:34:33,391 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:34:33,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:34:33,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1166773720, now seen corresponding path program 1 times [2021-03-26 10:34:33,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:34:33,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617096558] [2021-03-26 10:34:33,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:34:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:34:33,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:33,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:33,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:33,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:34:33,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617096558] [2021-03-26 10:34:33,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:34:33,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:34:33,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686439630] [2021-03-26 10:34:33,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:34:33,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:34:33,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:34:33,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:34:33,474 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 215 [2021-03-26 10:34:33,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:33,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:34:33,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 215 [2021-03-26 10:34:33,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:34:33,517 INFO L129 PetriNetUnfolder]: 11/91 cut-off events. [2021-03-26 10:34:33,517 INFO L130 PetriNetUnfolder]: For 244/468 co-relation queries the response was YES. [2021-03-26 10:34:33,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 91 events. 11/91 cut-off events. For 244/468 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 419 event pairs, 2 based on Foata normal form. 4/89 useless extension candidates. Maximal degree in co-relation 199. Up to 27 conditions per place. [2021-03-26 10:34:33,518 INFO L132 encePairwiseOnDemand]: 210/215 looper letters, 4 selfloop transitions, 4 changer transitions 2/31 dead transitions. [2021-03-26 10:34:33,518 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 138 flow [2021-03-26 10:34:33,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:34:33,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:34:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 767 transitions. [2021-03-26 10:34:33,522 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.891860465116279 [2021-03-26 10:34:33,522 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 767 transitions. [2021-03-26 10:34:33,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 767 transitions. [2021-03-26 10:34:33,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:34:33,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 767 transitions. [2021-03-26 10:34:33,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 191.75) internal successors, (767), 4 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:33,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:33,525 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:33,525 INFO L185 Difference]: Start difference. First operand has 42 places, 28 transitions, 105 flow. Second operand 4 states and 767 transitions. [2021-03-26 10:34:33,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 138 flow [2021-03-26 10:34:33,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 31 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:34:33,526 INFO L241 Difference]: Finished difference. Result has 45 places, 28 transitions, 115 flow [2021-03-26 10:34:33,526 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2021-03-26 10:34:33,526 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -11 predicate places. [2021-03-26 10:34:33,526 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:34:33,527 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 28 transitions, 115 flow [2021-03-26 10:34:33,527 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 28 transitions, 115 flow [2021-03-26 10:34:33,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 28 transitions, 115 flow [2021-03-26 10:34:33,534 INFO L129 PetriNetUnfolder]: 6/57 cut-off events. [2021-03-26 10:34:33,534 INFO L130 PetriNetUnfolder]: For 118/141 co-relation queries the response was YES. [2021-03-26 10:34:33,534 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 57 events. 6/57 cut-off events. For 118/141 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 192 event pairs, 2 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 127. Up to 18 conditions per place. [2021-03-26 10:34:33,534 INFO L142 LiptonReduction]: Number of co-enabled transitions 326 [2021-03-26 10:34:36,724 INFO L154 LiptonReduction]: Checked pairs total: 251 [2021-03-26 10:34:36,724 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:34:36,724 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3198 [2021-03-26 10:34:36,725 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 115 flow [2021-03-26 10:34:36,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:36,725 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:34:36,726 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:34:36,726 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:34:36,726 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:34:36,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:34:36,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1845085266, now seen corresponding path program 2 times [2021-03-26 10:34:36,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:34:36,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480297342] [2021-03-26 10:34:36,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:34:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:34:36,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:36,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:34:36,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:36,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:34:36,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:36,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:34:36,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:36,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:34:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:34:36,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480297342] [2021-03-26 10:34:36,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:34:36,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:34:36,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468822875] [2021-03-26 10:34:36,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:34:36,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:34:36,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:34:36,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:34:36,829 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 215 [2021-03-26 10:34:36,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 160.6) internal successors, (803), 5 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:36,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:34:36,830 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 215 [2021-03-26 10:34:36,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:34:37,025 INFO L129 PetriNetUnfolder]: 123/321 cut-off events. [2021-03-26 10:34:37,025 INFO L130 PetriNetUnfolder]: For 505/530 co-relation queries the response was YES. [2021-03-26 10:34:37,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 321 events. 123/321 cut-off events. For 505/530 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1691 event pairs, 51 based on Foata normal form. 6/310 useless extension candidates. Maximal degree in co-relation 801. Up to 180 conditions per place. [2021-03-26 10:34:37,028 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 12 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2021-03-26 10:34:37,028 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 34 transitions, 168 flow [2021-03-26 10:34:37,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:34:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:34:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 654 transitions. [2021-03-26 10:34:37,031 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7604651162790698 [2021-03-26 10:34:37,031 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 654 transitions. [2021-03-26 10:34:37,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 654 transitions. [2021-03-26 10:34:37,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:34:37,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 654 transitions. [2021-03-26 10:34:37,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 163.5) internal successors, (654), 4 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:37,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:37,035 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:37,035 INFO L185 Difference]: Start difference. First operand has 45 places, 28 transitions, 115 flow. Second operand 4 states and 654 transitions. [2021-03-26 10:34:37,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 34 transitions, 168 flow [2021-03-26 10:34:37,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 158 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:34:37,039 INFO L241 Difference]: Finished difference. Result has 46 places, 32 transitions, 145 flow [2021-03-26 10:34:37,039 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2021-03-26 10:34:37,039 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -10 predicate places. [2021-03-26 10:34:37,039 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:34:37,039 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 32 transitions, 145 flow [2021-03-26 10:34:37,039 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 32 transitions, 145 flow [2021-03-26 10:34:37,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 32 transitions, 145 flow [2021-03-26 10:34:37,054 INFO L129 PetriNetUnfolder]: 38/145 cut-off events. [2021-03-26 10:34:37,055 INFO L130 PetriNetUnfolder]: For 308/329 co-relation queries the response was YES. [2021-03-26 10:34:37,056 INFO L84 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 145 events. 38/145 cut-off events. For 308/329 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 708 event pairs, 14 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 381. Up to 71 conditions per place. [2021-03-26 10:34:37,057 INFO L142 LiptonReduction]: Number of co-enabled transitions 374 [2021-03-26 10:34:37,099 INFO L154 LiptonReduction]: Checked pairs total: 189 [2021-03-26 10:34:37,099 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:34:37,099 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 60 [2021-03-26 10:34:37,100 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 145 flow [2021-03-26 10:34:37,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 160.6) internal successors, (803), 5 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:37,100 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:34:37,100 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:34:37,100 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:34:37,100 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:34:37,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:34:37,101 INFO L82 PathProgramCache]: Analyzing trace with hash -854639865, now seen corresponding path program 1 times [2021-03-26 10:34:37,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:34:37,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15037325] [2021-03-26 10:34:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:34:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:34:37,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:37,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:37,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:37,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:37,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:37,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:34:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:34:37,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15037325] [2021-03-26 10:34:37,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:34:37,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:34:37,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093952675] [2021-03-26 10:34:37,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:34:37,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:34:37,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:34:37,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:34:37,215 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2021-03-26 10:34:37,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:37,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:34:37,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2021-03-26 10:34:37,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:34:37,333 INFO L129 PetriNetUnfolder]: 525/964 cut-off events. [2021-03-26 10:34:37,333 INFO L130 PetriNetUnfolder]: For 1224/1315 co-relation queries the response was YES. [2021-03-26 10:34:37,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 964 events. 525/964 cut-off events. For 1224/1315 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 6203 event pairs, 217 based on Foata normal form. 62/837 useless extension candidates. Maximal degree in co-relation 2388. Up to 618 conditions per place. [2021-03-26 10:34:37,340 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 11 selfloop transitions, 9 changer transitions 2/46 dead transitions. [2021-03-26 10:34:37,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 217 flow [2021-03-26 10:34:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:34:37,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:34:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 954 transitions. [2021-03-26 10:34:37,342 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8874418604651163 [2021-03-26 10:34:37,343 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 954 transitions. [2021-03-26 10:34:37,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 954 transitions. [2021-03-26 10:34:37,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:34:37,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 954 transitions. [2021-03-26 10:34:37,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 190.8) internal successors, (954), 5 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:37,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:37,347 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:37,347 INFO L185 Difference]: Start difference. First operand has 46 places, 32 transitions, 145 flow. Second operand 5 states and 954 transitions. [2021-03-26 10:34:37,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 217 flow [2021-03-26 10:34:37,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 207 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:34:37,350 INFO L241 Difference]: Finished difference. Result has 51 places, 40 transitions, 204 flow [2021-03-26 10:34:37,350 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2021-03-26 10:34:37,350 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2021-03-26 10:34:37,350 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:34:37,350 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 40 transitions, 204 flow [2021-03-26 10:34:37,350 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 204 flow [2021-03-26 10:34:37,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 204 flow [2021-03-26 10:34:37,407 INFO L129 PetriNetUnfolder]: 420/814 cut-off events. [2021-03-26 10:34:37,407 INFO L130 PetriNetUnfolder]: For 1221/1514 co-relation queries the response was YES. [2021-03-26 10:34:37,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 814 events. 420/814 cut-off events. For 1221/1514 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 5292 event pairs, 203 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 2485. Up to 550 conditions per place. [2021-03-26 10:34:37,415 INFO L142 LiptonReduction]: Number of co-enabled transitions 542 [2021-03-26 10:34:37,514 INFO L154 LiptonReduction]: Checked pairs total: 113 [2021-03-26 10:34:37,514 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:34:37,514 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 164 [2021-03-26 10:34:37,516 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 198 flow [2021-03-26 10:34:37,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:37,516 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:34:37,516 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:34:37,516 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:34:37,516 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:34:37,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:34:37,517 INFO L82 PathProgramCache]: Analyzing trace with hash -841219645, now seen corresponding path program 1 times [2021-03-26 10:34:37,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:34:37,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132544268] [2021-03-26 10:34:37,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:34:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:34:37,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:37,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:37,600 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-26 10:34:37,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:34:37,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:37,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:37,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:37,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:34:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:34:37,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132544268] [2021-03-26 10:34:37,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:34:37,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:34:37,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701328250] [2021-03-26 10:34:37,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:34:37,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:34:37,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:34:37,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:34:37,614 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2021-03-26 10:34:37,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 186.8) internal successors, (934), 5 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:37,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:34:37,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2021-03-26 10:34:37,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:34:37,797 INFO L129 PetriNetUnfolder]: 357/696 cut-off events. [2021-03-26 10:34:37,797 INFO L130 PetriNetUnfolder]: For 1147/1953 co-relation queries the response was YES. [2021-03-26 10:34:37,799 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2576 conditions, 696 events. 357/696 cut-off events. For 1147/1953 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4226 event pairs, 58 based on Foata normal form. 92/698 useless extension candidates. Maximal degree in co-relation 2556. Up to 461 conditions per place. [2021-03-26 10:34:37,801 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 12 selfloop transitions, 13 changer transitions 2/51 dead transitions. [2021-03-26 10:34:37,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 314 flow [2021-03-26 10:34:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:34:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:34:37,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1145 transitions. [2021-03-26 10:34:37,804 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8875968992248062 [2021-03-26 10:34:37,804 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1145 transitions. [2021-03-26 10:34:37,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1145 transitions. [2021-03-26 10:34:37,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:34:37,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1145 transitions. [2021-03-26 10:34:37,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 190.83333333333334) internal successors, (1145), 6 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:37,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:37,808 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:37,808 INFO L185 Difference]: Start difference. First operand has 51 places, 39 transitions, 198 flow. Second operand 6 states and 1145 transitions. [2021-03-26 10:34:37,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 314 flow [2021-03-26 10:34:37,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 307 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:34:37,814 INFO L241 Difference]: Finished difference. Result has 55 places, 44 transitions, 283 flow [2021-03-26 10:34:37,814 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2021-03-26 10:34:37,814 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2021-03-26 10:34:37,814 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:34:37,814 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 44 transitions, 283 flow [2021-03-26 10:34:37,814 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 44 transitions, 283 flow [2021-03-26 10:34:37,814 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 44 transitions, 283 flow [2021-03-26 10:34:37,858 INFO L129 PetriNetUnfolder]: 260/572 cut-off events. [2021-03-26 10:34:37,859 INFO L130 PetriNetUnfolder]: For 1723/2150 co-relation queries the response was YES. [2021-03-26 10:34:37,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 572 events. 260/572 cut-off events. For 1723/2150 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 3665 event pairs, 53 based on Foata normal form. 3/523 useless extension candidates. Maximal degree in co-relation 2476. Up to 387 conditions per place. [2021-03-26 10:34:37,864 INFO L142 LiptonReduction]: Number of co-enabled transitions 604 [2021-03-26 10:34:37,894 INFO L154 LiptonReduction]: Checked pairs total: 125 [2021-03-26 10:34:37,894 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:34:37,894 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 80 [2021-03-26 10:34:37,894 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 275 flow [2021-03-26 10:34:37,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 186.8) internal successors, (934), 5 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:37,895 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:34:37,895 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:34:37,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:34:37,895 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:34:37,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:34:37,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1311773746, now seen corresponding path program 1 times [2021-03-26 10:34:37,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:34:37,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8525670] [2021-03-26 10:34:37,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:34:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:34:37,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:37,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:37,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:37,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:37,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:37,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:37,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:37,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:37,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:37,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:34:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:34:37,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8525670] [2021-03-26 10:34:37,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:34:37,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:34:37,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291902026] [2021-03-26 10:34:37,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:34:37,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:34:37,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:34:37,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:34:37,981 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2021-03-26 10:34:37,982 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:37,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:34:37,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2021-03-26 10:34:37,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:34:38,094 INFO L129 PetriNetUnfolder]: 228/457 cut-off events. [2021-03-26 10:34:38,094 INFO L130 PetriNetUnfolder]: For 1299/2468 co-relation queries the response was YES. [2021-03-26 10:34:38,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2137 conditions, 457 events. 228/457 cut-off events. For 1299/2468 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2447 event pairs, 9 based on Foata normal form. 102/501 useless extension candidates. Maximal degree in co-relation 2114. Up to 307 conditions per place. [2021-03-26 10:34:38,097 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 10 selfloop transitions, 17 changer transitions 5/56 dead transitions. [2021-03-26 10:34:38,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 441 flow [2021-03-26 10:34:38,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:34:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:34:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1336 transitions. [2021-03-26 10:34:38,100 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8877076411960133 [2021-03-26 10:34:38,100 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1336 transitions. [2021-03-26 10:34:38,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1336 transitions. [2021-03-26 10:34:38,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:34:38,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1336 transitions. [2021-03-26 10:34:38,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 190.85714285714286) internal successors, (1336), 7 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:38,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:38,105 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:38,105 INFO L185 Difference]: Start difference. First operand has 55 places, 43 transitions, 275 flow. Second operand 7 states and 1336 transitions. [2021-03-26 10:34:38,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 441 flow [2021-03-26 10:34:38,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 379 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 10:34:38,109 INFO L241 Difference]: Finished difference. Result has 58 places, 48 transitions, 335 flow [2021-03-26 10:34:38,109 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2021-03-26 10:34:38,110 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2021-03-26 10:34:38,110 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:34:38,110 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 48 transitions, 335 flow [2021-03-26 10:34:38,110 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 48 transitions, 335 flow [2021-03-26 10:34:38,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 48 transitions, 335 flow [2021-03-26 10:34:38,132 INFO L129 PetriNetUnfolder]: 123/315 cut-off events. [2021-03-26 10:34:38,132 INFO L130 PetriNetUnfolder]: For 1065/1231 co-relation queries the response was YES. [2021-03-26 10:34:38,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 315 events. 123/315 cut-off events. For 1065/1231 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1773 event pairs, 8 based on Foata normal form. 9/297 useless extension candidates. Maximal degree in co-relation 1343. Up to 209 conditions per place. [2021-03-26 10:34:38,135 INFO L142 LiptonReduction]: Number of co-enabled transitions 576 [2021-03-26 10:34:38,147 INFO L154 LiptonReduction]: Checked pairs total: 123 [2021-03-26 10:34:38,147 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:34:38,147 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-03-26 10:34:38,148 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 325 flow [2021-03-26 10:34:38,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:38,149 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:34:38,149 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:34:38,149 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:34:38,149 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:34:38,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:34:38,150 INFO L82 PathProgramCache]: Analyzing trace with hash 830702765, now seen corresponding path program 1 times [2021-03-26 10:34:38,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:34:38,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133902040] [2021-03-26 10:34:38,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:34:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:34:38,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:38,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:34:38,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:38,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:38,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:38,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:34:38,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133902040] [2021-03-26 10:34:38,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:34:38,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:34:38,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810134435] [2021-03-26 10:34:38,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:34:38,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:34:38,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:34:38,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:34:38,203 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 215 [2021-03-26 10:34:38,204 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 190.25) internal successors, (761), 4 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:38,204 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:34:38,204 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 215 [2021-03-26 10:34:38,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:34:38,261 INFO L129 PetriNetUnfolder]: 166/402 cut-off events. [2021-03-26 10:34:38,261 INFO L130 PetriNetUnfolder]: For 1396/1710 co-relation queries the response was YES. [2021-03-26 10:34:38,262 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 402 events. 166/402 cut-off events. For 1396/1710 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2223 event pairs, 14 based on Foata normal form. 21/380 useless extension candidates. Maximal degree in co-relation 1573. Up to 227 conditions per place. [2021-03-26 10:34:38,263 INFO L132 encePairwiseOnDemand]: 211/215 looper letters, 4 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2021-03-26 10:34:38,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 46 transitions, 315 flow [2021-03-26 10:34:38,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:34:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:34:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 954 transitions. [2021-03-26 10:34:38,267 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8874418604651163 [2021-03-26 10:34:38,267 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 954 transitions. [2021-03-26 10:34:38,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 954 transitions. [2021-03-26 10:34:38,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:34:38,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 954 transitions. [2021-03-26 10:34:38,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 190.8) internal successors, (954), 5 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:38,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:38,270 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:38,270 INFO L185 Difference]: Start difference. First operand has 58 places, 47 transitions, 325 flow. Second operand 5 states and 954 transitions. [2021-03-26 10:34:38,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 46 transitions, 315 flow [2021-03-26 10:34:38,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 46 transitions, 272 flow, removed 15 selfloop flow, removed 4 redundant places. [2021-03-26 10:34:38,275 INFO L241 Difference]: Finished difference. Result has 58 places, 46 transitions, 273 flow [2021-03-26 10:34:38,275 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2021-03-26 10:34:38,275 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2021-03-26 10:34:38,275 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:34:38,276 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 46 transitions, 273 flow [2021-03-26 10:34:38,276 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 46 transitions, 273 flow [2021-03-26 10:34:38,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 46 transitions, 273 flow [2021-03-26 10:34:38,304 INFO L129 PetriNetUnfolder]: 183/443 cut-off events. [2021-03-26 10:34:38,304 INFO L130 PetriNetUnfolder]: For 883/996 co-relation queries the response was YES. [2021-03-26 10:34:38,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 443 events. 183/443 cut-off events. For 883/996 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2642 event pairs, 13 based on Foata normal form. 22/429 useless extension candidates. Maximal degree in co-relation 1400. Up to 175 conditions per place. [2021-03-26 10:34:38,308 INFO L142 LiptonReduction]: Number of co-enabled transitions 552 [2021-03-26 10:34:38,311 INFO L154 LiptonReduction]: Checked pairs total: 30 [2021-03-26 10:34:38,311 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:34:38,312 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-03-26 10:34:38,314 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 273 flow [2021-03-26 10:34:38,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 190.25) internal successors, (761), 4 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:38,314 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:34:38,314 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:34:38,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:34:38,314 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:34:38,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:34:38,315 INFO L82 PathProgramCache]: Analyzing trace with hash 92877433, now seen corresponding path program 2 times [2021-03-26 10:34:38,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:34:38,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719504025] [2021-03-26 10:34:38,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:34:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:34:38,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:38,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 10:34:38,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:38,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:34:38,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:38,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 10:34:38,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:38,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:34:38,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:38,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 10:34:38,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:38,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2021-03-26 10:34:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:34:38,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719504025] [2021-03-26 10:34:38,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:34:38,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:34:38,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299630433] [2021-03-26 10:34:38,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:34:38,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:34:38,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:34:38,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:34:38,611 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 215 [2021-03-26 10:34:38,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 273 flow. Second operand has 8 states, 8 states have (on average 153.125) internal successors, (1225), 8 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:38,612 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:34:38,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 215 [2021-03-26 10:34:38,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:34:38,936 INFO L129 PetriNetUnfolder]: 444/972 cut-off events. [2021-03-26 10:34:38,937 INFO L130 PetriNetUnfolder]: For 2019/2284 co-relation queries the response was YES. [2021-03-26 10:34:38,940 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3360 conditions, 972 events. 444/972 cut-off events. For 2019/2284 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6366 event pairs, 29 based on Foata normal form. 42/918 useless extension candidates. Maximal degree in co-relation 3336. Up to 406 conditions per place. [2021-03-26 10:34:38,942 INFO L132 encePairwiseOnDemand]: 207/215 looper letters, 14 selfloop transitions, 14 changer transitions 3/60 dead transitions. [2021-03-26 10:34:38,942 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 392 flow [2021-03-26 10:34:38,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:34:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:34:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 940 transitions. [2021-03-26 10:34:38,945 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7286821705426356 [2021-03-26 10:34:38,945 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 940 transitions. [2021-03-26 10:34:38,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 940 transitions. [2021-03-26 10:34:38,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:34:38,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 940 transitions. [2021-03-26 10:34:38,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 156.66666666666666) internal successors, (940), 6 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:38,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:38,948 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:38,948 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 273 flow. Second operand 6 states and 940 transitions. [2021-03-26 10:34:38,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 392 flow [2021-03-26 10:34:38,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 385 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:34:38,953 INFO L241 Difference]: Finished difference. Result has 63 places, 52 transitions, 348 flow [2021-03-26 10:34:38,953 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2021-03-26 10:34:38,953 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2021-03-26 10:34:38,953 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:34:38,953 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 52 transitions, 348 flow [2021-03-26 10:34:38,954 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 52 transitions, 348 flow [2021-03-26 10:34:38,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 52 transitions, 348 flow [2021-03-26 10:34:39,006 INFO L129 PetriNetUnfolder]: 393/874 cut-off events. [2021-03-26 10:34:39,006 INFO L130 PetriNetUnfolder]: For 2015/2219 co-relation queries the response was YES. [2021-03-26 10:34:39,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3094 conditions, 874 events. 393/874 cut-off events. For 2015/2219 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6139 event pairs, 30 based on Foata normal form. 28/828 useless extension candidates. Maximal degree in co-relation 3069. Up to 416 conditions per place. [2021-03-26 10:34:39,014 INFO L142 LiptonReduction]: Number of co-enabled transitions 624 [2021-03-26 10:34:39,145 INFO L154 LiptonReduction]: Checked pairs total: 34 [2021-03-26 10:34:39,145 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:34:39,146 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 193 [2021-03-26 10:34:39,146 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 348 flow [2021-03-26 10:34:39,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 153.125) internal successors, (1225), 8 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:39,146 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:34:39,147 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:34:39,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:34:39,147 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:34:39,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:34:39,147 INFO L82 PathProgramCache]: Analyzing trace with hash -509108837, now seen corresponding path program 1 times [2021-03-26 10:34:39,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:34:39,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028339898] [2021-03-26 10:34:39,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:34:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:34:39,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:39,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:39,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:39,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:39,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:39,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:39,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:39,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:39,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:39,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:34:39,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:34:39,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:34:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:34:39,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028339898] [2021-03-26 10:34:39,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:34:39,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:34:39,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622920425] [2021-03-26 10:34:39,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:34:39,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:34:39,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:34:39,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:34:39,309 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2021-03-26 10:34:39,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 348 flow. Second operand has 7 states, 7 states have (on average 186.85714285714286) internal successors, (1308), 7 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:39,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:34:39,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2021-03-26 10:34:39,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:34:39,496 INFO L129 PetriNetUnfolder]: 773/1386 cut-off events. [2021-03-26 10:34:39,496 INFO L130 PetriNetUnfolder]: For 2870/5666 co-relation queries the response was YES. [2021-03-26 10:34:39,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5377 conditions, 1386 events. 773/1386 cut-off events. For 2870/5666 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 8856 event pairs, 0 based on Foata normal form. 342/1498 useless extension candidates. Maximal degree in co-relation 5350. Up to 577 conditions per place. [2021-03-26 10:34:39,504 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 6 selfloop transitions, 18 changer transitions 8/59 dead transitions. [2021-03-26 10:34:39,504 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 59 transitions, 448 flow [2021-03-26 10:34:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:34:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:34:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1519 transitions. [2021-03-26 10:34:39,508 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8831395348837209 [2021-03-26 10:34:39,508 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1519 transitions. [2021-03-26 10:34:39,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1519 transitions. [2021-03-26 10:34:39,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:34:39,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1519 transitions. [2021-03-26 10:34:39,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 189.875) internal successors, (1519), 8 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:39,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:39,522 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:39,522 INFO L185 Difference]: Start difference. First operand has 63 places, 52 transitions, 348 flow. Second operand 8 states and 1519 transitions. [2021-03-26 10:34:39,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 59 transitions, 448 flow [2021-03-26 10:34:39,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 405 flow, removed 16 selfloop flow, removed 4 redundant places. [2021-03-26 10:34:39,534 INFO L241 Difference]: Finished difference. Result has 69 places, 48 transitions, 338 flow [2021-03-26 10:34:39,534 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=338, PETRI_PLACES=69, PETRI_TRANSITIONS=48} [2021-03-26 10:34:39,535 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2021-03-26 10:34:39,535 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:34:39,535 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 48 transitions, 338 flow [2021-03-26 10:34:39,535 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 48 transitions, 338 flow [2021-03-26 10:34:39,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 48 transitions, 338 flow [2021-03-26 10:34:39,560 INFO L129 PetriNetUnfolder]: 149/358 cut-off events. [2021-03-26 10:34:39,560 INFO L130 PetriNetUnfolder]: For 860/981 co-relation queries the response was YES. [2021-03-26 10:34:39,561 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 358 events. 149/358 cut-off events. For 860/981 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2109 event pairs, 2 based on Foata normal form. 4/326 useless extension candidates. Maximal degree in co-relation 1470. Up to 165 conditions per place. [2021-03-26 10:34:39,564 INFO L142 LiptonReduction]: Number of co-enabled transitions 466 [2021-03-26 10:34:39,678 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 10:34:39,795 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 10:34:40,001 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:34:40,199 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:34:41,304 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 363 [2021-03-26 10:34:42,437 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 363 [2021-03-26 10:34:44,843 WARN L205 SmtUtils]: Spent 2.40 s on a formula simplification that was a NOOP. DAG size: 530 [2021-03-26 10:34:47,359 WARN L205 SmtUtils]: Spent 2.51 s on a formula simplification that was a NOOP. DAG size: 530 [2021-03-26 10:34:49,823 WARN L205 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 307 DAG size of output: 256 [2021-03-26 10:34:50,420 WARN L205 SmtUtils]: Spent 594.00 ms on a formula simplification that was a NOOP. DAG size: 234 [2021-03-26 10:34:54,998 WARN L205 SmtUtils]: Spent 4.57 s on a formula simplification. DAG size of input: 420 DAG size of output: 339 [2021-03-26 10:34:56,473 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 316 [2021-03-26 10:34:56,482 INFO L154 LiptonReduction]: Checked pairs total: 29 [2021-03-26 10:34:56,482 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:34:56,482 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16947 [2021-03-26 10:34:56,483 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 320 flow [2021-03-26 10:34:56,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 186.85714285714286) internal successors, (1308), 7 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:34:56,483 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:34:56,484 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:34:56,484 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:34:56,484 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:34:56,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:34:56,484 INFO L82 PathProgramCache]: Analyzing trace with hash 569387234, now seen corresponding path program 1 times [2021-03-26 10:34:56,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:34:56,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327133499] [2021-03-26 10:34:56,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:34:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:34:56,628 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:34:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:34:56,712 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:34:56,760 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:34:56,761 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:34:56,761 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:34:56,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:34:56 BasicIcfg [2021-03-26 10:34:56,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:34:56,889 INFO L168 Benchmark]: Toolchain (without parser) took 78846.04 ms. Allocated memory was 377.5 MB in the beginning and 1.2 GB in the end (delta: 796.9 MB). Free memory was 340.8 MB in the beginning and 812.7 MB in the end (delta: -471.8 MB). Peak memory consumption was 328.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:34:56,889 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 377.5 MB. Free memory is still 359.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:34:56,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.44 ms. Allocated memory is still 377.5 MB. Free memory was 340.7 MB in the beginning and 334.1 MB in the end (delta: 6.6 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:34:56,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.42 ms. Allocated memory is still 377.5 MB. Free memory was 334.1 MB in the beginning and 330.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:34:56,895 INFO L168 Benchmark]: Boogie Preprocessor took 53.61 ms. Allocated memory is still 377.5 MB. Free memory was 330.9 MB in the beginning and 327.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:34:56,896 INFO L168 Benchmark]: RCFGBuilder took 2412.82 ms. Allocated memory was 377.5 MB in the beginning and 455.1 MB in the end (delta: 77.6 MB). Free memory was 327.8 MB in the beginning and 244.3 MB in the end (delta: 83.5 MB). Peak memory consumption was 163.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:34:56,896 INFO L168 Benchmark]: TraceAbstraction took 75901.93 ms. Allocated memory was 455.1 MB in the beginning and 1.2 GB in the end (delta: 719.3 MB). Free memory was 244.3 MB in the beginning and 812.7 MB in the end (delta: -568.3 MB). Peak memory consumption was 151.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:34:56,897 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.13 ms. Allocated memory is still 377.5 MB. Free memory is still 359.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 386.44 ms. Allocated memory is still 377.5 MB. Free memory was 340.7 MB in the beginning and 334.1 MB in the end (delta: 6.6 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 78.42 ms. Allocated memory is still 377.5 MB. Free memory was 334.1 MB in the beginning and 330.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 53.61 ms. Allocated memory is still 377.5 MB. Free memory was 330.9 MB in the beginning and 327.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2412.82 ms. Allocated memory was 377.5 MB in the beginning and 455.1 MB in the end (delta: 77.6 MB). Free memory was 327.8 MB in the beginning and 244.3 MB in the end (delta: 83.5 MB). Peak memory consumption was 163.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 75901.93 ms. Allocated memory was 455.1 MB in the beginning and 1.2 GB in the end (delta: 719.3 MB). Free memory was 244.3 MB in the beginning and 812.7 MB in the end (delta: -568.3 MB). Peak memory consumption was 151.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33687.3ms, 122 PlacesBefore, 56 PlacesAfterwards, 110 TransitionsBefore, 44 TransitionsAfterwards, 1430 CoEnabledTransitionPairs, 4 FixpointIterations, 39 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 69 TotalNumberOfCompositions, 1852 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1067, positive: 1013, positive conditional: 1013, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1067, positive: 1013, positive conditional: 0, positive unconditional: 1013, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1067, positive: 1013, positive conditional: 0, positive unconditional: 1013, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 902, positive: 862, positive conditional: 0, positive unconditional: 862, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 902, positive: 851, positive conditional: 0, positive unconditional: 851, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9574, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 1299, negative conditional: 0, negative unconditional: 1299, unknown: 8239, unknown conditional: 0, unknown unconditional: 8239] ], Cache Queries: [ total: 1067, positive: 151, positive conditional: 0, positive unconditional: 151, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 902, unknown conditional: 0, unknown unconditional: 902] , Statistics on independence cache: Total cache size (in pairs): 902, Positive cache size: 862, Positive conditional cache size: 0, Positive unconditional cache size: 862, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3870.5ms, 54 PlacesBefore, 41 PlacesAfterwards, 44 TransitionsBefore, 31 TransitionsAfterwards, 320 CoEnabledTransitionPairs, 3 FixpointIterations, 13 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 759 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 231, positive: 183, positive conditional: 183, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 231, positive: 183, positive conditional: 0, positive unconditional: 183, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 231, positive: 183, positive conditional: 0, positive unconditional: 183, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2851, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 2757, unknown conditional: 0, unknown unconditional: 2757] ], Cache Queries: [ total: 231, positive: 153, positive conditional: 0, positive unconditional: 153, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 37, unknown conditional: 0, unknown unconditional: 37] , Statistics on independence cache: Total cache size (in pairs): 939, Positive cache size: 892, Positive conditional cache size: 0, Positive unconditional cache size: 892, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4101.7ms, 45 PlacesBefore, 38 PlacesAfterwards, 31 TransitionsBefore, 26 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 4 FixpointIterations, 5 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 948 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 304, positive: 244, positive conditional: 244, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 304, positive: 244, positive conditional: 16, positive unconditional: 228, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 304, positive: 244, positive conditional: 16, positive unconditional: 228, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 304, positive: 244, positive conditional: 16, positive unconditional: 228, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 939, Positive cache size: 892, Positive conditional cache size: 0, Positive unconditional cache size: 892, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Eliminated conditions: 40 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 199.5ms, 39 PlacesBefore, 39 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 236 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 192, negative conditional: 0, negative unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 944, Positive cache size: 893, Positive conditional cache size: 0, Positive unconditional cache size: 893, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5661.0ms, 40 PlacesBefore, 40 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 274 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 81, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 81, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5655, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 5647, unknown conditional: 0, unknown unconditional: 5647] ], Cache Queries: [ total: 81, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 949, Positive cache size: 894, Positive conditional cache size: 0, Positive unconditional cache size: 894, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3144.7ms, 42 PlacesBefore, 42 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 243 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, positive: 24, positive conditional: 1, positive unconditional: 23, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 24, positive conditional: 1, positive unconditional: 23, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 3, positive conditional: 1, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3135, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 3087, unknown conditional: 0, unknown unconditional: 3087] ], Cache Queries: [ total: 38, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 956, Positive cache size: 897, Positive conditional cache size: 1, Positive unconditional cache size: 896, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3197.6ms, 45 PlacesBefore, 45 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 251 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3188, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3188, unknown conditional: 0, unknown unconditional: 3188] ], Cache Queries: [ total: 35, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 959, Positive cache size: 898, Positive conditional cache size: 1, Positive unconditional cache size: 897, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 59.9ms, 46 PlacesBefore, 46 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 189 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, positive: 45, positive conditional: 7, positive unconditional: 38, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, positive: 45, positive conditional: 7, positive unconditional: 38, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 1, positive unconditional: 9, 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: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, positive: 36, positive conditional: 17, positive unconditional: 19, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, positive: 35, positive conditional: 6, positive unconditional: 29, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 10, unknown conditional: 1, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 969, Positive cache size: 908, Positive conditional cache size: 2, Positive unconditional cache size: 906, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Eliminated conditions: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 164.0ms, 51 PlacesBefore, 51 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 113 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, positive: 36, positive conditional: 22, positive unconditional: 14, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 36, positive conditional: 22, positive unconditional: 14, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 73, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 73, negative conditional: 73, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, positive: 30, positive conditional: 16, positive unconditional: 14, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 914, Positive conditional cache size: 8, Positive unconditional cache size: 906, Negative cache size: 62, Negative conditional cache size: 1, Negative unconditional cache size: 61, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 79.5ms, 55 PlacesBefore, 55 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 125 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, positive: 35, positive conditional: 13, positive unconditional: 22, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, positive: 35, positive conditional: 13, positive unconditional: 22, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 4, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, positive: 28, positive conditional: 9, positive unconditional: 19, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 983, Positive cache size: 921, Positive conditional cache size: 12, Positive unconditional cache size: 909, Negative cache size: 62, Negative conditional cache size: 1, Negative unconditional cache size: 61, Eliminated conditions: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.8ms, 58 PlacesBefore, 58 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 576 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 123 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, positive: 34, positive conditional: 11, positive unconditional: 23, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 34, positive conditional: 11, positive unconditional: 23, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 32, positive conditional: 9, positive unconditional: 23, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 985, Positive cache size: 923, Positive conditional cache size: 14, Positive unconditional cache size: 909, Negative cache size: 62, Negative conditional cache size: 1, Negative unconditional cache size: 61, Eliminated conditions: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.8ms, 58 PlacesBefore, 58 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 30 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 985, Positive cache size: 923, Positive conditional cache size: 14, Positive unconditional cache size: 909, Negative cache size: 62, Negative conditional cache size: 1, Negative unconditional cache size: 61, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 192.0ms, 63 PlacesBefore, 63 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 624 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 34 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 103, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 103, negative conditional: 103, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 988, Positive cache size: 924, Positive conditional cache size: 15, Positive unconditional cache size: 909, Negative cache size: 64, Negative conditional cache size: 3, Negative unconditional cache size: 61, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16947.1ms, 69 PlacesBefore, 64 PlacesAfterwards, 48 TransitionsBefore, 44 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 29 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 2, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 22, positive: 16, positive conditional: 6, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 993, Positive cache size: 929, Positive conditional cache size: 17, Positive unconditional cache size: 912, Negative cache size: 64, Negative conditional cache size: 3, Negative unconditional cache size: 61, Eliminated conditions: 12 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2145; [L853] FCALL, FORK 0 pthread_create(&t2145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] EXPR 1 \read(y) [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L770] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L770] EXPR 1 !y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))) [L770] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L770] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L771] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L771] EXPR 1 !y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))) [L771] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L771] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L772] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] EXPR 1 !y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0))) [L772] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L773] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] EXPR 1 !y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L773] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] EXPR 1 !y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L774] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] EXPR 1 !y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L775] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L777] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L778] EXPR 1 \read(y) [L778] 1 __unbuffered_p0_EAX = y [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] EXPR 1 \read(y) [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] 1 y = y$flush_delayed ? y$mem_tmp : y [L780] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t2146; [L855] FCALL, FORK 0 pthread_create(&t2146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=2, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2147; [L857] FCALL, FORK 0 pthread_create(&t2147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=2, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=2, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2148; [L810] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=2, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L859] FCALL, FORK 0 pthread_create(&t2148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=2, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=2, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 \read(y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L831] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L833] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L834] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L834] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L788] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 4 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L4] COND FALSE 0 !(!cond) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 \read(y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] EXPR 0 \read(y) [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] EXPR 0 \read(y) [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 x == 2 && y == 2 [L885] EXPR 0 \read(y) [L885] EXPR 0 x == 2 && y == 2 [L885] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L886] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L886] EXPR 0 \read(y) [L886] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L886] 0 y = y$flush_delayed ? y$mem_tmp : y [L887] 0 y$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=1, weak$$choice2=0, x=2, y={7:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 127 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 10.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 75638.0ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1885.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 33771.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 63 SDtfs, 58 SDslu, 30 SDs, 0 SdLazy, 379 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 495.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 582.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=12, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 76.3ms SsaConstructionTime, 731.8ms SatisfiabilityAnalysisTime, 1119.3ms InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 1554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...