/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/mix005_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 09:49:43,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 09:49:43,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 09:49:43,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 09:49:43,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 09:49:43,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 09:49:43,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 09:49:43,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 09:49:43,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 09:49:43,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 09:49:43,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 09:49:43,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 09:49:43,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 09:49:43,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 09:49:43,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 09:49:43,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 09:49:43,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 09:49:43,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 09:49:43,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 09:49:43,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 09:49:43,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 09:49:43,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 09:49:43,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 09:49:43,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 09:49:43,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 09:49:43,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 09:49:43,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 09:49:43,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 09:49:43,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 09:49:43,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 09:49:43,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 09:49:43,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 09:49:43,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 09:49:43,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 09:49:43,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 09:49:43,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 09:49:43,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 09:49:43,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 09:49:43,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 09:49:43,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 09:49:43,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 09:49:43,178 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 09:49:43,212 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 09:49:43,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 09:49:43,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 09:49:43,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 09:49:43,215 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 09:49:43,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 09:49:43,216 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 09:49:43,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 09:49:43,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 09:49:43,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 09:49:43,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 09:49:43,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 09:49:43,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 09:49:43,218 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 09:49:43,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 09:49:43,218 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 09:49:43,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 09:49:43,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 09:49:43,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 09:49:43,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 09:49:43,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 09:49:43,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 09:49:43,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 09:49:43,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 09:49:43,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 09:49:43,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 09:49:43,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 09:49:43,220 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 09:49:43,220 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 09:49:43,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 09:49:43,220 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 09:49:43,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 09:49:43,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 09:49:43,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 09:49:43,595 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 09:49:43,596 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 09:49:43,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc.i [2021-03-26 09:49:43,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c40a1083/f18b555a575b4e73b7fcd26916a461f6/FLAG685822246 [2021-03-26 09:49:44,145 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 09:49:44,145 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc.i [2021-03-26 09:49:44,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c40a1083/f18b555a575b4e73b7fcd26916a461f6/FLAG685822246 [2021-03-26 09:49:44,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c40a1083/f18b555a575b4e73b7fcd26916a461f6 [2021-03-26 09:49:44,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 09:49:44,626 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 09:49:44,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 09:49:44,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 09:49:44,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 09:49:44,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:49:44" (1/1) ... [2021-03-26 09:49:44,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a542c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:49:44, skipping insertion in model container [2021-03-26 09:49:44,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:49:44" (1/1) ... [2021-03-26 09:49:44,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 09:49:44,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 09:49:44,810 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/mix005_power.oepc.i[951,964] [2021-03-26 09:49:45,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:49:45,049 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 09:49:45,059 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/mix005_power.oepc.i[951,964] [2021-03-26 09:49:45,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:49:45,186 INFO L208 MainTranslator]: Completed translation [2021-03-26 09:49:45,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:49:45 WrapperNode [2021-03-26 09:49:45,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 09:49:45,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 09:49:45,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 09:49:45,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 09:49:45,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:49:45" (1/1) ... [2021-03-26 09:49:45,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:49:45" (1/1) ... [2021-03-26 09:49:45,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 09:49:45,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 09:49:45,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 09:49:45,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 09:49:45,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:49:45" (1/1) ... [2021-03-26 09:49:45,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:49:45" (1/1) ... [2021-03-26 09:49:45,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:49:45" (1/1) ... [2021-03-26 09:49:45,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:49:45" (1/1) ... [2021-03-26 09:49:45,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:49:45" (1/1) ... [2021-03-26 09:49:45,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:49:45" (1/1) ... [2021-03-26 09:49:45,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:49:45" (1/1) ... [2021-03-26 09:49:45,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 09:49:45,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 09:49:45,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 09:49:45,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 09:49:45,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:49:45" (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 09:49:45,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 09:49:45,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 09:49:45,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 09:49:45,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 09:49:45,373 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 09:49:45,373 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 09:49:45,373 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 09:49:45,373 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 09:49:45,373 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 09:49:45,373 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 09:49:45,374 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 09:49:45,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 09:49:45,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 09:49:45,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 09:49:45,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 09:49:45,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 09:49:45,376 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 09:49:47,210 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 09:49:47,211 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 09:49:47,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:49:47 BoogieIcfgContainer [2021-03-26 09:49:47,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 09:49:47,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 09:49:47,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 09:49:47,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 09:49:47,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 09:49:44" (1/3) ... [2021-03-26 09:49:47,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8df5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:49:47, skipping insertion in model container [2021-03-26 09:49:47,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:49:45" (2/3) ... [2021-03-26 09:49:47,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8df5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:49:47, skipping insertion in model container [2021-03-26 09:49:47,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:49:47" (3/3) ... [2021-03-26 09:49:47,219 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_power.oepc.i [2021-03-26 09:49:47,225 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 09:49:47,229 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 09:49:47,229 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 09:49:47,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,271 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,271 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,272 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,272 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,272 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,272 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,272 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,273 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,279 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,279 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,279 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,279 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,283 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,283 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,283 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,283 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,283 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,283 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,284 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,288 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,288 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,288 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,288 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,289 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,296 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,296 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,296 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,296 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,296 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,312 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,312 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,327 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,328 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,328 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,329 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,329 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,331 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,332 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:49:47,333 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 09:49:47,348 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 09:49:47,377 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 09:49:47,377 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 09:49:47,377 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 09:49:47,377 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 09:49:47,378 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 09:49:47,378 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 09:49:47,378 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 09:49:47,378 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 09:49:47,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-26 09:49:47,441 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-26 09:49:47,441 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:49:47,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 09:49:47,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-26 09:49:47,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-26 09:49:47,461 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:49:47,474 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-26 09:49:47,476 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-26 09:49:47,481 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-26 09:49:47,515 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-26 09:49:47,515 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:49:47,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 09:49:47,520 INFO L142 LiptonReduction]: Number of co-enabled transitions 2886 [2021-03-26 09:49:49,023 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 09:49:49,417 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 09:49:49,578 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 09:49:50,966 INFO L154 LiptonReduction]: Checked pairs total: 5647 [2021-03-26 09:49:50,967 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-26 09:49:50,969 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3509 [2021-03-26 09:49:50,976 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-26 09:49:50,977 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:49:50,977 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:49:50,977 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:49:50,978 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:49:50,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:49:50,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1588435965, now seen corresponding path program 1 times [2021-03-26 09:49:50,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:49:50,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683100160] [2021-03-26 09:49:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:49:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:49:51,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:49:51,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:49:51,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:49:51,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:49:51,209 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 09:49:51,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683100160] [2021-03-26 09:49:51,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:49:51,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 09:49:51,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469485720] [2021-03-26 09:49:51,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 09:49:51,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:49:51,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 09:49:51,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 09:49:51,231 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 195 [2021-03-26 09:49:51,236 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states 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 09:49:51,236 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:49:51,236 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 195 [2021-03-26 09:49:51,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:49:51,370 INFO L129 PetriNetUnfolder]: 133/349 cut-off events. [2021-03-26 09:49:51,370 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:49:51,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 349 events. 133/349 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1875 event pairs, 110 based on Foata normal form. 33/362 useless extension candidates. Maximal degree in co-relation 546. Up to 153 conditions per place. [2021-03-26 09:49:51,377 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 11 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2021-03-26 09:49:51,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 52 transitions, 142 flow [2021-03-26 09:49:51,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 09:49:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 09:49:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2021-03-26 09:49:51,396 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2021-03-26 09:49:51,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2021-03-26 09:49:51,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2021-03-26 09:49:51,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:49:51,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2021-03-26 09:49:51,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states 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 09:49:51,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states 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 09:49:51,416 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states 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 09:49:51,418 INFO L185 Difference]: Start difference. First operand has 62 places, 50 transitions, 112 flow. Second operand 3 states and 535 transitions. [2021-03-26 09:49:51,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 52 transitions, 142 flow [2021-03-26 09:49:51,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 09:49:51,422 INFO L241 Difference]: Finished difference. Result has 58 places, 47 transitions, 106 flow [2021-03-26 09:49:51,424 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2021-03-26 09:49:51,425 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2021-03-26 09:49:51,425 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:49:51,425 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-26 09:49:51,426 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-26 09:49:51,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 47 transitions, 106 flow [2021-03-26 09:49:51,433 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2021-03-26 09:49:51,433 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:49:51,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 09:49:51,435 INFO L142 LiptonReduction]: Number of co-enabled transitions 702 [2021-03-26 09:49:52,680 INFO L154 LiptonReduction]: Checked pairs total: 3042 [2021-03-26 09:49:52,680 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 09:49:52,681 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1256 [2021-03-26 09:49:52,682 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 82 flow [2021-03-26 09:49:52,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states 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 09:49:52,682 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:49:52,683 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 09:49:52,683 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 09:49:52,683 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:49:52,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:49:52,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1813580090, now seen corresponding path program 1 times [2021-03-26 09:49:52,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:49:52,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908854524] [2021-03-26 09:49:52,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:49:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:49:52,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:49:52,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:49:52,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:49:52,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:49:52,797 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 09:49:52,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 09:49:52,830 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 09:49:52,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 09:49:52,836 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 09:49:52,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908854524] [2021-03-26 09:49:52,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:49:52,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:49:52,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824663899] [2021-03-26 09:49:52,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 09:49:52,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:49:52,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 09:49:52,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 09:49:52,841 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 207 [2021-03-26 09:49:52,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:49:52,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:49:52,842 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 207 [2021-03-26 09:49:52,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:49:53,020 INFO L129 PetriNetUnfolder]: 397/800 cut-off events. [2021-03-26 09:49:53,020 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 09:49:53,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 800 events. 397/800 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4542 event pairs, 34 based on Foata normal form. 0/740 useless extension candidates. Maximal degree in co-relation 1413. Up to 253 conditions per place. [2021-03-26 09:49:53,027 INFO L132 encePairwiseOnDemand]: 197/207 looper letters, 12 selfloop transitions, 8 changer transitions 21/65 dead transitions. [2021-03-26 09:49:53,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 224 flow [2021-03-26 09:49:53,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 09:49:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 09:49:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1177 transitions. [2021-03-26 09:49:53,032 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8122843340234644 [2021-03-26 09:49:53,032 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1177 transitions. [2021-03-26 09:49:53,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1177 transitions. [2021-03-26 09:49:53,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:49:53,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1177 transitions. [2021-03-26 09:49:53,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.14285714285714) internal successors, (1177), 7 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states 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 09:49:53,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states 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 09:49:53,040 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states 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 09:49:53,040 INFO L185 Difference]: Start difference. First operand has 46 places, 35 transitions, 82 flow. Second operand 7 states and 1177 transitions. [2021-03-26 09:49:53,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 224 flow [2021-03-26 09:49:53,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:49:53,042 INFO L241 Difference]: Finished difference. Result has 55 places, 40 transitions, 148 flow [2021-03-26 09:49:53,042 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2021-03-26 09:49:53,043 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2021-03-26 09:49:53,043 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:49:53,043 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 40 transitions, 148 flow [2021-03-26 09:49:53,044 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 40 transitions, 148 flow [2021-03-26 09:49:53,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 148 flow [2021-03-26 09:49:53,145 INFO L129 PetriNetUnfolder]: 178/461 cut-off events. [2021-03-26 09:49:53,145 INFO L130 PetriNetUnfolder]: For 124/258 co-relation queries the response was YES. [2021-03-26 09:49:53,147 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 461 events. 178/461 cut-off events. For 124/258 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2856 event pairs, 98 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 1035. Up to 249 conditions per place. [2021-03-26 09:49:53,152 INFO L142 LiptonReduction]: Number of co-enabled transitions 562 [2021-03-26 09:49:54,203 INFO L154 LiptonReduction]: Checked pairs total: 1230 [2021-03-26 09:49:54,203 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 09:49:54,203 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1160 [2021-03-26 09:49:54,204 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 142 flow [2021-03-26 09:49:54,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:49:54,205 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:49:54,205 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:49:54,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 09:49:54,205 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:49:54,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:49:54,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1102842643, now seen corresponding path program 1 times [2021-03-26 09:49:54,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:49:54,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042506614] [2021-03-26 09:49:54,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:49:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:49:54,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:49:54,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:49:54,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:49:54,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:49:54,311 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 09:49:54,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 09:49:54,324 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 09:49:54,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042506614] [2021-03-26 09:49:54,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:49:54,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:49:54,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73869338] [2021-03-26 09:49:54,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:49:54,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:49:54,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:49:54,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:49:54,332 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 210 [2021-03-26 09:49:54,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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 09:49:54,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:49:54,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 210 [2021-03-26 09:49:54,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:49:54,429 INFO L129 PetriNetUnfolder]: 180/496 cut-off events. [2021-03-26 09:49:54,430 INFO L130 PetriNetUnfolder]: For 289/530 co-relation queries the response was YES. [2021-03-26 09:49:54,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 496 events. 180/496 cut-off events. For 289/530 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3048 event pairs, 85 based on Foata normal form. 8/493 useless extension candidates. Maximal degree in co-relation 1402. Up to 251 conditions per place. [2021-03-26 09:49:54,434 INFO L132 encePairwiseOnDemand]: 200/210 looper letters, 11 selfloop transitions, 17 changer transitions 0/49 dead transitions. [2021-03-26 09:49:54,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 270 flow [2021-03-26 09:49:54,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:49:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:49:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 687 transitions. [2021-03-26 09:49:54,437 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8178571428571428 [2021-03-26 09:49:54,437 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 687 transitions. [2021-03-26 09:49:54,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 687 transitions. [2021-03-26 09:49:54,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:49:54,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 687 transitions. [2021-03-26 09:49:54,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states 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 09:49:54,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:49:54,441 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:49:54,441 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 142 flow. Second operand 4 states and 687 transitions. [2021-03-26 09:49:54,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 270 flow [2021-03-26 09:49:54,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 236 flow, removed 15 selfloop flow, removed 3 redundant places. [2021-03-26 09:49:54,447 INFO L241 Difference]: Finished difference. Result has 50 places, 45 transitions, 229 flow [2021-03-26 09:49:54,447 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2021-03-26 09:49:54,447 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -12 predicate places. [2021-03-26 09:49:54,447 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:49:54,447 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 45 transitions, 229 flow [2021-03-26 09:49:54,448 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 45 transitions, 229 flow [2021-03-26 09:49:54,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 229 flow [2021-03-26 09:49:54,507 INFO L129 PetriNetUnfolder]: 179/482 cut-off events. [2021-03-26 09:49:54,507 INFO L130 PetriNetUnfolder]: For 308/351 co-relation queries the response was YES. [2021-03-26 09:49:54,509 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1292 conditions, 482 events. 179/482 cut-off events. For 308/351 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2982 event pairs, 84 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 1276. Up to 239 conditions per place. [2021-03-26 09:49:54,514 INFO L142 LiptonReduction]: Number of co-enabled transitions 722 [2021-03-26 09:49:54,993 WARN L205 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 09:49:55,171 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 09:49:55,595 WARN L205 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 09:49:55,754 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 09:49:55,785 INFO L154 LiptonReduction]: Checked pairs total: 1444 [2021-03-26 09:49:55,786 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:49:55,786 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1339 [2021-03-26 09:49:55,787 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 225 flow [2021-03-26 09:49:55,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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 09:49:55,787 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:49:55,788 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:49:55,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 09:49:55,788 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:49:55,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:49:55,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1327435401, now seen corresponding path program 1 times [2021-03-26 09:49:55,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:49:55,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184232922] [2021-03-26 09:49:55,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:49:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:49:55,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:49:55,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:49:55,852 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 09:49:55,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 09:49:55,866 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 09:49:55,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184232922] [2021-03-26 09:49:55,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:49:55,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 09:49:55,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880084559] [2021-03-26 09:49:55,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:49:55,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:49:55,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:49:55,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:49:55,869 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 211 [2021-03-26 09:49:55,870 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states 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 09:49:55,870 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:49:55,870 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 211 [2021-03-26 09:49:55,870 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:49:55,957 INFO L129 PetriNetUnfolder]: 151/408 cut-off events. [2021-03-26 09:49:55,957 INFO L130 PetriNetUnfolder]: For 431/768 co-relation queries the response was YES. [2021-03-26 09:49:55,959 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 408 events. 151/408 cut-off events. For 431/768 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2302 event pairs, 34 based on Foata normal form. 14/410 useless extension candidates. Maximal degree in co-relation 1359. Up to 198 conditions per place. [2021-03-26 09:49:55,962 INFO L132 encePairwiseOnDemand]: 202/211 looper letters, 22 selfloop transitions, 16 changer transitions 0/59 dead transitions. [2021-03-26 09:49:55,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 414 flow [2021-03-26 09:49:55,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:49:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:49:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 684 transitions. [2021-03-26 09:49:55,965 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8104265402843602 [2021-03-26 09:49:55,965 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 684 transitions. [2021-03-26 09:49:55,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 684 transitions. [2021-03-26 09:49:55,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:49:55,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 684 transitions. [2021-03-26 09:49:55,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states 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 09:49:55,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states 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 09:49:55,969 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states 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 09:49:55,969 INFO L185 Difference]: Start difference. First operand has 49 places, 44 transitions, 225 flow. Second operand 4 states and 684 transitions. [2021-03-26 09:49:55,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 414 flow [2021-03-26 09:49:55,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 412 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-26 09:49:55,974 INFO L241 Difference]: Finished difference. Result has 55 places, 54 transitions, 392 flow [2021-03-26 09:49:55,975 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=392, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2021-03-26 09:49:55,975 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2021-03-26 09:49:55,975 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:49:55,975 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 54 transitions, 392 flow [2021-03-26 09:49:55,975 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 54 transitions, 392 flow [2021-03-26 09:49:55,976 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 392 flow [2021-03-26 09:49:56,027 INFO L129 PetriNetUnfolder]: 148/428 cut-off events. [2021-03-26 09:49:56,027 INFO L130 PetriNetUnfolder]: For 681/724 co-relation queries the response was YES. [2021-03-26 09:49:56,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 428 events. 148/428 cut-off events. For 681/724 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2649 event pairs, 63 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 1345. Up to 196 conditions per place. [2021-03-26 09:49:56,033 INFO L142 LiptonReduction]: Number of co-enabled transitions 860 [2021-03-26 09:49:56,065 INFO L154 LiptonReduction]: Checked pairs total: 1095 [2021-03-26 09:49:56,066 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:49:56,066 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 91 [2021-03-26 09:49:56,070 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 392 flow [2021-03-26 09:49:56,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states 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 09:49:56,071 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:49:56,071 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:49:56,071 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 09:49:56,072 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:49:56,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:49:56,072 INFO L82 PathProgramCache]: Analyzing trace with hash 563534622, now seen corresponding path program 1 times [2021-03-26 09:49:56,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:49:56,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450668617] [2021-03-26 09:49:56,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:49:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:49:56,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:49:56,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:49:56,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:49:56,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:49:56,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:49:56,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:49:56,154 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 09:49:56,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450668617] [2021-03-26 09:49:56,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:49:56,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:49:56,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075386935] [2021-03-26 09:49:56,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:49:56,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:49:56,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:49:56,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:49:56,160 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 211 [2021-03-26 09:49:56,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 392 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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 09:49:56,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:49:56,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 211 [2021-03-26 09:49:56,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:49:56,456 INFO L129 PetriNetUnfolder]: 1061/2082 cut-off events. [2021-03-26 09:49:56,456 INFO L130 PetriNetUnfolder]: For 1179/1275 co-relation queries the response was YES. [2021-03-26 09:49:56,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4947 conditions, 2082 events. 1061/2082 cut-off events. For 1179/1275 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 16493 event pairs, 488 based on Foata normal form. 150/1858 useless extension candidates. Maximal degree in co-relation 4927. Up to 1377 conditions per place. [2021-03-26 09:49:56,480 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 12 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2021-03-26 09:49:56,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 464 flow [2021-03-26 09:49:56,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:49:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:49:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 899 transitions. [2021-03-26 09:49:56,483 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.852132701421801 [2021-03-26 09:49:56,483 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 899 transitions. [2021-03-26 09:49:56,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 899 transitions. [2021-03-26 09:49:56,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:49:56,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 899 transitions. [2021-03-26 09:49:56,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:49:56,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states 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 09:49:56,488 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states 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 09:49:56,488 INFO L185 Difference]: Start difference. First operand has 55 places, 54 transitions, 392 flow. Second operand 5 states and 899 transitions. [2021-03-26 09:49:56,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 464 flow [2021-03-26 09:49:56,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 09:49:56,495 INFO L241 Difference]: Finished difference. Result has 61 places, 63 transitions, 463 flow [2021-03-26 09:49:56,496 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=463, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2021-03-26 09:49:56,496 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2021-03-26 09:49:56,496 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:49:56,496 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 63 transitions, 463 flow [2021-03-26 09:49:56,496 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 63 transitions, 463 flow [2021-03-26 09:49:56,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 63 transitions, 463 flow [2021-03-26 09:49:56,652 INFO L129 PetriNetUnfolder]: 793/1637 cut-off events. [2021-03-26 09:49:56,652 INFO L130 PetriNetUnfolder]: For 1655/2093 co-relation queries the response was YES. [2021-03-26 09:49:56,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5068 conditions, 1637 events. 793/1637 cut-off events. For 1655/2093 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 12633 event pairs, 359 based on Foata normal form. 20/1481 useless extension candidates. Maximal degree in co-relation 5046. Up to 1027 conditions per place. [2021-03-26 09:49:56,681 INFO L142 LiptonReduction]: Number of co-enabled transitions 1278 [2021-03-26 09:49:57,202 INFO L154 LiptonReduction]: Checked pairs total: 2407 [2021-03-26 09:49:57,202 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:49:57,202 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 706 [2021-03-26 09:49:57,204 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 457 flow [2021-03-26 09:49:57,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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 09:49:57,205 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:49:57,205 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:49:57,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 09:49:57,205 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:49:57,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:49:57,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1788372241, now seen corresponding path program 1 times [2021-03-26 09:49:57,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:49:57,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201575210] [2021-03-26 09:49:57,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:49:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:49:57,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:49:57,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:49:57,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:49:57,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:49:57,291 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 09:49:57,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201575210] [2021-03-26 09:49:57,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:49:57,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 09:49:57,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837318124] [2021-03-26 09:49:57,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 09:49:57,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:49:57,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 09:49:57,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 09:49:57,294 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 211 [2021-03-26 09:49:57,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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 09:49:57,295 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:49:57,295 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 211 [2021-03-26 09:49:57,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:49:57,541 INFO L129 PetriNetUnfolder]: 877/1763 cut-off events. [2021-03-26 09:49:57,541 INFO L130 PetriNetUnfolder]: For 2940/3324 co-relation queries the response was YES. [2021-03-26 09:49:57,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5510 conditions, 1763 events. 877/1763 cut-off events. For 2940/3324 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 13254 event pairs, 458 based on Foata normal form. 66/1653 useless extension candidates. Maximal degree in co-relation 5486. Up to 1105 conditions per place. [2021-03-26 09:49:57,556 INFO L132 encePairwiseOnDemand]: 208/211 looper letters, 3 selfloop transitions, 12 changer transitions 4/58 dead transitions. [2021-03-26 09:49:57,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 465 flow [2021-03-26 09:49:57,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 09:49:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 09:49:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2021-03-26 09:49:57,558 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8815165876777251 [2021-03-26 09:49:57,559 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 558 transitions. [2021-03-26 09:49:57,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 558 transitions. [2021-03-26 09:49:57,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:49:57,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 558 transitions. [2021-03-26 09:49:57,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states 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 09:49:57,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states 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 09:49:57,561 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states 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 09:49:57,561 INFO L185 Difference]: Start difference. First operand has 61 places, 62 transitions, 457 flow. Second operand 3 states and 558 transitions. [2021-03-26 09:49:57,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 465 flow [2021-03-26 09:49:57,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 458 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 09:49:57,578 INFO L241 Difference]: Finished difference. Result has 60 places, 54 transitions, 424 flow [2021-03-26 09:49:57,578 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2021-03-26 09:49:57,578 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2021-03-26 09:49:57,578 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:49:57,578 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 54 transitions, 424 flow [2021-03-26 09:49:57,578 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 54 transitions, 424 flow [2021-03-26 09:49:57,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 54 transitions, 424 flow [2021-03-26 09:49:57,743 INFO L129 PetriNetUnfolder]: 816/1634 cut-off events. [2021-03-26 09:49:57,743 INFO L130 PetriNetUnfolder]: For 2137/2355 co-relation queries the response was YES. [2021-03-26 09:49:57,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4885 conditions, 1634 events. 816/1634 cut-off events. For 2137/2355 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 12211 event pairs, 418 based on Foata normal form. 1/1494 useless extension candidates. Maximal degree in co-relation 4863. Up to 1028 conditions per place. [2021-03-26 09:49:57,770 INFO L142 LiptonReduction]: Number of co-enabled transitions 920 [2021-03-26 09:49:58,104 INFO L154 LiptonReduction]: Checked pairs total: 682 [2021-03-26 09:49:58,104 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:49:58,104 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 526 [2021-03-26 09:49:58,105 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 424 flow [2021-03-26 09:49:58,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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 09:49:58,105 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:49:58,105 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:49:58,106 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 09:49:58,106 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:49:58,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:49:58,106 INFO L82 PathProgramCache]: Analyzing trace with hash 275915152, now seen corresponding path program 1 times [2021-03-26 09:49:58,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:49:58,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508372610] [2021-03-26 09:49:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:49:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:49:58,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:49:58,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:49:58,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:49:58,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:49:58,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:49:58,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:49:58,148 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 09:49:58,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508372610] [2021-03-26 09:49:58,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:49:58,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:49:58,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094985874] [2021-03-26 09:49:58,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:49:58,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:49:58,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:49:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:49:58,150 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 211 [2021-03-26 09:49:58,151 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 424 flow. Second operand has 4 states, 4 states have (on average 178.25) internal successors, (713), 4 states have internal predecessors, (713), 0 states have call successors, (0), 0 states 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 09:49:58,151 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:49:58,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 211 [2021-03-26 09:49:58,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:49:58,433 INFO L129 PetriNetUnfolder]: 1284/2539 cut-off events. [2021-03-26 09:49:58,433 INFO L130 PetriNetUnfolder]: For 4091/4777 co-relation queries the response was YES. [2021-03-26 09:49:58,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7523 conditions, 2539 events. 1284/2539 cut-off events. For 4091/4777 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 20656 event pairs, 677 based on Foata normal form. 61/2342 useless extension candidates. Maximal degree in co-relation 7499. Up to 1709 conditions per place. [2021-03-26 09:49:58,459 INFO L132 encePairwiseOnDemand]: 208/211 looper letters, 6 selfloop transitions, 3 changer transitions 2/57 dead transitions. [2021-03-26 09:49:58,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 57 transitions, 473 flow [2021-03-26 09:49:58,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:49:58,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:49:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 716 transitions. [2021-03-26 09:49:58,462 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8483412322274881 [2021-03-26 09:49:58,462 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 716 transitions. [2021-03-26 09:49:58,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 716 transitions. [2021-03-26 09:49:58,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:49:58,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 716 transitions. [2021-03-26 09:49:58,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states 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 09:49:58,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states 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 09:49:58,466 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states 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 09:49:58,466 INFO L185 Difference]: Start difference. First operand has 60 places, 54 transitions, 424 flow. Second operand 4 states and 716 transitions. [2021-03-26 09:49:58,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 57 transitions, 473 flow [2021-03-26 09:49:58,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 57 transitions, 461 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 09:49:58,473 INFO L241 Difference]: Finished difference. Result has 64 places, 55 transitions, 433 flow [2021-03-26 09:49:58,473 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=433, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2021-03-26 09:49:58,474 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2021-03-26 09:49:58,474 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:49:58,474 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 55 transitions, 433 flow [2021-03-26 09:49:58,474 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 55 transitions, 433 flow [2021-03-26 09:49:58,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 55 transitions, 433 flow [2021-03-26 09:49:58,764 INFO L129 PetriNetUnfolder]: 1234/2441 cut-off events. [2021-03-26 09:49:58,764 INFO L130 PetriNetUnfolder]: For 3103/3717 co-relation queries the response was YES. [2021-03-26 09:49:58,782 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7274 conditions, 2441 events. 1234/2441 cut-off events. For 3103/3717 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 19806 event pairs, 636 based on Foata normal form. 3/2188 useless extension candidates. Maximal degree in co-relation 7250. Up to 1621 conditions per place. [2021-03-26 09:49:58,819 INFO L142 LiptonReduction]: Number of co-enabled transitions 944 [2021-03-26 09:50:00,099 INFO L154 LiptonReduction]: Checked pairs total: 1427 [2021-03-26 09:50:00,100 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:50:00,100 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1626 [2021-03-26 09:50:00,100 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 436 flow [2021-03-26 09:50:00,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.25) internal successors, (713), 4 states have internal predecessors, (713), 0 states have call successors, (0), 0 states 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 09:50:00,101 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:50:00,101 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:50:00,101 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 09:50:00,101 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:50:00,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:50:00,101 INFO L82 PathProgramCache]: Analyzing trace with hash -523289072, now seen corresponding path program 2 times [2021-03-26 09:50:00,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:50:00,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796027787] [2021-03-26 09:50:00,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:50:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:50:00,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:00,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:50:00,146 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-26 09:50:00,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 09:50:00,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:00,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:50:00,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:00,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:50:00,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 09:50:00,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796027787] [2021-03-26 09:50:00,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:50:00,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:50:00,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742655414] [2021-03-26 09:50:00,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 09:50:00,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:50:00,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 09:50:00,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 09:50:00,160 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 212 [2021-03-26 09:50:00,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 436 flow. Second operand has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states 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 09:50:00,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:50:00,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 212 [2021-03-26 09:50:00,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:50:00,510 INFO L129 PetriNetUnfolder]: 1423/2851 cut-off events. [2021-03-26 09:50:00,511 INFO L130 PetriNetUnfolder]: For 3378/6029 co-relation queries the response was YES. [2021-03-26 09:50:00,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10237 conditions, 2851 events. 1423/2851 cut-off events. For 3378/6029 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 23287 event pairs, 229 based on Foata normal form. 466/3035 useless extension candidates. Maximal degree in co-relation 10211. Up to 1988 conditions per place. [2021-03-26 09:50:00,538 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 13 selfloop transitions, 14 changer transitions 0/70 dead transitions. [2021-03-26 09:50:00,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 70 transitions, 570 flow [2021-03-26 09:50:00,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 09:50:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 09:50:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1085 transitions. [2021-03-26 09:50:00,541 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8529874213836478 [2021-03-26 09:50:00,541 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1085 transitions. [2021-03-26 09:50:00,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1085 transitions. [2021-03-26 09:50:00,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:50:00,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1085 transitions. [2021-03-26 09:50:00,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states 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 09:50:00,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states 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 09:50:00,548 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states 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 09:50:00,548 INFO L185 Difference]: Start difference. First operand has 64 places, 55 transitions, 436 flow. Second operand 6 states and 1085 transitions. [2021-03-26 09:50:00,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 70 transitions, 570 flow [2021-03-26 09:50:00,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 70 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 09:50:00,555 INFO L241 Difference]: Finished difference. Result has 71 places, 64 transitions, 554 flow [2021-03-26 09:50:00,555 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=554, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2021-03-26 09:50:00,555 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2021-03-26 09:50:00,555 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:50:00,556 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 64 transitions, 554 flow [2021-03-26 09:50:00,556 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 64 transitions, 554 flow [2021-03-26 09:50:00,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 64 transitions, 554 flow [2021-03-26 09:50:00,766 INFO L129 PetriNetUnfolder]: 908/2039 cut-off events. [2021-03-26 09:50:00,766 INFO L130 PetriNetUnfolder]: For 5739/7039 co-relation queries the response was YES. [2021-03-26 09:50:00,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8997 conditions, 2039 events. 908/2039 cut-off events. For 5739/7039 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 17521 event pairs, 207 based on Foata normal form. 57/1993 useless extension candidates. Maximal degree in co-relation 8969. Up to 1439 conditions per place. [2021-03-26 09:50:00,800 INFO L142 LiptonReduction]: Number of co-enabled transitions 1288 [2021-03-26 09:50:02,483 INFO L154 LiptonReduction]: Checked pairs total: 1962 [2021-03-26 09:50:02,483 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:50:02,483 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1928 [2021-03-26 09:50:02,483 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 546 flow [2021-03-26 09:50:02,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states 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 09:50:02,484 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:50:02,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] [2021-03-26 09:50:02,484 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 09:50:02,484 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:50:02,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:50:02,485 INFO L82 PathProgramCache]: Analyzing trace with hash 264698349, now seen corresponding path program 1 times [2021-03-26 09:50:02,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:50:02,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738233571] [2021-03-26 09:50:02,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:50:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:50:02,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:02,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:50:02,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:02,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:50:02,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:02,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:50:02,534 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 09:50:02,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 09:50:02,547 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 09:50:02,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738233571] [2021-03-26 09:50:02,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:50:02,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:50:02,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588480830] [2021-03-26 09:50:02,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 09:50:02,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:50:02,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 09:50:02,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 09:50:02,549 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 212 [2021-03-26 09:50:02,550 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 546 flow. Second operand has 5 states, 5 states have (on average 163.6) internal successors, (818), 5 states have internal predecessors, (818), 0 states have call successors, (0), 0 states 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 09:50:02,550 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:50:02,550 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 212 [2021-03-26 09:50:02,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:50:02,905 INFO L129 PetriNetUnfolder]: 1186/2589 cut-off events. [2021-03-26 09:50:02,905 INFO L130 PetriNetUnfolder]: For 8337/9867 co-relation queries the response was YES. [2021-03-26 09:50:02,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11576 conditions, 2589 events. 1186/2589 cut-off events. For 8337/9867 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 21565 event pairs, 252 based on Foata normal form. 118/2566 useless extension candidates. Maximal degree in co-relation 11546. Up to 1687 conditions per place. [2021-03-26 09:50:02,940 INFO L132 encePairwiseOnDemand]: 201/212 looper letters, 29 selfloop transitions, 34 changer transitions 1/92 dead transitions. [2021-03-26 09:50:02,940 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 92 transitions, 973 flow [2021-03-26 09:50:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 09:50:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 09:50:02,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1007 transitions. [2021-03-26 09:50:02,943 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2021-03-26 09:50:02,943 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1007 transitions. [2021-03-26 09:50:02,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1007 transitions. [2021-03-26 09:50:02,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:50:02,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1007 transitions. [2021-03-26 09:50:02,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 167.83333333333334) internal successors, (1007), 6 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states 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 09:50:02,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states 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 09:50:02,949 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states 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 09:50:02,949 INFO L185 Difference]: Start difference. First operand has 71 places, 63 transitions, 546 flow. Second operand 6 states and 1007 transitions. [2021-03-26 09:50:02,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 92 transitions, 973 flow [2021-03-26 09:50:03,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 92 transitions, 935 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-26 09:50:03,017 INFO L241 Difference]: Finished difference. Result has 74 places, 80 transitions, 856 flow [2021-03-26 09:50:03,017 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=856, PETRI_PLACES=74, PETRI_TRANSITIONS=80} [2021-03-26 09:50:03,017 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2021-03-26 09:50:03,017 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:50:03,017 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 80 transitions, 856 flow [2021-03-26 09:50:03,018 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 80 transitions, 856 flow [2021-03-26 09:50:03,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 80 transitions, 856 flow [2021-03-26 09:50:03,285 INFO L129 PetriNetUnfolder]: 1155/2570 cut-off events. [2021-03-26 09:50:03,285 INFO L130 PetriNetUnfolder]: For 5770/6248 co-relation queries the response was YES. [2021-03-26 09:50:03,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9009 conditions, 2570 events. 1155/2570 cut-off events. For 5770/6248 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 22131 event pairs, 306 based on Foata normal form. 84/2524 useless extension candidates. Maximal degree in co-relation 8979. Up to 1539 conditions per place. [2021-03-26 09:50:03,321 INFO L142 LiptonReduction]: Number of co-enabled transitions 1390 [2021-03-26 09:50:05,495 INFO L154 LiptonReduction]: Checked pairs total: 2840 [2021-03-26 09:50:05,495 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:50:05,496 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2479 [2021-03-26 09:50:05,496 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 80 transitions, 858 flow [2021-03-26 09:50:05,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.6) internal successors, (818), 5 states have internal predecessors, (818), 0 states have call successors, (0), 0 states 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 09:50:05,496 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:50:05,497 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:50:05,497 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 09:50:05,497 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:50:05,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:50:05,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1914187867, now seen corresponding path program 2 times [2021-03-26 09:50:05,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:50:05,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39812687] [2021-03-26 09:50:05,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:50:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:50:05,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:05,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:50:05,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:05,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:50:05,555 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-26 09:50:05,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 09:50:05,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:05,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:50:05,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:05,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:50:05,565 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 09:50:05,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39812687] [2021-03-26 09:50:05,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:50:05,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 09:50:05,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524115523] [2021-03-26 09:50:05,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 09:50:05,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:50:05,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 09:50:05,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 09:50:05,567 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 213 [2021-03-26 09:50:05,568 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 80 transitions, 858 flow. Second operand has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states 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 09:50:05,568 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:50:05,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 213 [2021-03-26 09:50:05,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:50:05,978 INFO L129 PetriNetUnfolder]: 1599/3186 cut-off events. [2021-03-26 09:50:05,978 INFO L130 PetriNetUnfolder]: For 6541/10193 co-relation queries the response was YES. [2021-03-26 09:50:06,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12464 conditions, 3186 events. 1599/3186 cut-off events. For 6541/10193 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 25813 event pairs, 93 based on Foata normal form. 760/3580 useless extension candidates. Maximal degree in co-relation 12432. Up to 1927 conditions per place. [2021-03-26 09:50:06,017 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 10 selfloop transitions, 18 changer transitions 4/96 dead transitions. [2021-03-26 09:50:06,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 96 transitions, 1030 flow [2021-03-26 09:50:06,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 09:50:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 09:50:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1273 transitions. [2021-03-26 09:50:06,020 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8537894030851777 [2021-03-26 09:50:06,020 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1273 transitions. [2021-03-26 09:50:06,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1273 transitions. [2021-03-26 09:50:06,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:50:06,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1273 transitions. [2021-03-26 09:50:06,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 181.85714285714286) internal successors, (1273), 7 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:50:06,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states 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 09:50:06,028 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states 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 09:50:06,028 INFO L185 Difference]: Start difference. First operand has 74 places, 80 transitions, 858 flow. Second operand 7 states and 1273 transitions. [2021-03-26 09:50:06,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 96 transitions, 1030 flow [2021-03-26 09:50:06,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 96 transitions, 1005 flow, removed 7 selfloop flow, removed 1 redundant places. [2021-03-26 09:50:06,046 INFO L241 Difference]: Finished difference. Result has 82 places, 89 transitions, 971 flow [2021-03-26 09:50:06,047 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=971, PETRI_PLACES=82, PETRI_TRANSITIONS=89} [2021-03-26 09:50:06,047 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 20 predicate places. [2021-03-26 09:50:06,047 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:50:06,047 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 89 transitions, 971 flow [2021-03-26 09:50:06,047 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 89 transitions, 971 flow [2021-03-26 09:50:06,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 89 transitions, 971 flow [2021-03-26 09:50:06,254 INFO L129 PetriNetUnfolder]: 803/2006 cut-off events. [2021-03-26 09:50:06,254 INFO L130 PetriNetUnfolder]: For 6409/6988 co-relation queries the response was YES. [2021-03-26 09:50:06,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9228 conditions, 2006 events. 803/2006 cut-off events. For 6409/6988 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 17391 event pairs, 76 based on Foata normal form. 1/1914 useless extension candidates. Maximal degree in co-relation 9194. Up to 1259 conditions per place. [2021-03-26 09:50:06,280 INFO L142 LiptonReduction]: Number of co-enabled transitions 1566 [2021-03-26 09:50:08,769 INFO L154 LiptonReduction]: Checked pairs total: 3930 [2021-03-26 09:50:08,769 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 09:50:08,770 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2723 [2021-03-26 09:50:08,770 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 963 flow [2021-03-26 09:50:08,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states 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 09:50:08,771 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:50:08,771 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:50:08,771 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 09:50:08,771 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:50:08,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:50:08,771 INFO L82 PathProgramCache]: Analyzing trace with hash 707791045, now seen corresponding path program 1 times [2021-03-26 09:50:08,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:50:08,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094242456] [2021-03-26 09:50:08,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:50:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:50:08,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:08,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 09:50:08,896 INFO L142 QuantifierPusher]: treesize reduction 14, result has 81.1 percent of original size [2021-03-26 09:50:08,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-03-26 09:50:08,928 INFO L142 QuantifierPusher]: treesize reduction 9, result has 73.5 percent of original size [2021-03-26 09:50:08,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 09:50:08,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:08,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 09:50:08,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:08,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 09:50:08,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:08,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 09:50:08,973 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 09:50:08,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094242456] [2021-03-26 09:50:08,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:50:08,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 09:50:08,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645279099] [2021-03-26 09:50:08,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 09:50:08,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:50:08,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 09:50:08,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-26 09:50:08,978 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 214 [2021-03-26 09:50:08,980 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 963 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states 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 09:50:08,980 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:50:08,980 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 214 [2021-03-26 09:50:08,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:50:10,230 INFO L129 PetriNetUnfolder]: 4040/7961 cut-off events. [2021-03-26 09:50:10,230 INFO L130 PetriNetUnfolder]: For 30391/31667 co-relation queries the response was YES. [2021-03-26 09:50:10,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33151 conditions, 7961 events. 4040/7961 cut-off events. For 30391/31667 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 69160 event pairs, 413 based on Foata normal form. 37/7695 useless extension candidates. Maximal degree in co-relation 33115. Up to 2716 conditions per place. [2021-03-26 09:50:10,283 INFO L132 encePairwiseOnDemand]: 196/214 looper letters, 50 selfloop transitions, 73 changer transitions 55/206 dead transitions. [2021-03-26 09:50:10,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 206 transitions, 2522 flow [2021-03-26 09:50:10,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 09:50:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 09:50:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1633 transitions. [2021-03-26 09:50:10,287 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.693712829226848 [2021-03-26 09:50:10,287 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1633 transitions. [2021-03-26 09:50:10,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1633 transitions. [2021-03-26 09:50:10,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:50:10,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1633 transitions. [2021-03-26 09:50:10,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 148.45454545454547) internal successors, (1633), 11 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states 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 09:50:10,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states 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 09:50:10,295 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states 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 09:50:10,295 INFO L185 Difference]: Start difference. First operand has 82 places, 88 transitions, 963 flow. Second operand 11 states and 1633 transitions. [2021-03-26 09:50:10,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 206 transitions, 2522 flow [2021-03-26 09:50:10,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 206 transitions, 2461 flow, removed 24 selfloop flow, removed 4 redundant places. [2021-03-26 09:50:10,812 INFO L241 Difference]: Finished difference. Result has 93 places, 119 transitions, 1432 flow [2021-03-26 09:50:10,812 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1432, PETRI_PLACES=93, PETRI_TRANSITIONS=119} [2021-03-26 09:50:10,812 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 31 predicate places. [2021-03-26 09:50:10,812 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:50:10,812 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 119 transitions, 1432 flow [2021-03-26 09:50:10,812 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 119 transitions, 1432 flow [2021-03-26 09:50:10,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 93 places, 119 transitions, 1432 flow [2021-03-26 09:50:11,056 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][10], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 196#(not (= 4 ~__unbuffered_cnt~0)), 139#true, 206#(= ~z~0 1), 79#P3EXITtrue, Black: 141#(= ~__unbuffered_p3_EAX~0 0), 87#L878-1true, Black: 142#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), Black: 208#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), Black: 210#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0)))), Black: 213#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), 154#true, 220#true, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), 161#true, Black: 224#(not (= 4 ~__unbuffered_cnt~0)), Black: 163#(= ~__unbuffered_p2_EAX~0 0), Black: 164#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), 232#true, Black: 171#(= ~__unbuffered_cnt~0 0), 50#L768true, Black: 174#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 52#P2EXITtrue, Black: 181#(= ~x~0 1), Black: 243#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 ~a$w_buff0~0)) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0)))), Black: 245#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0)))), Black: 247#(and (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0))), Black: 234#(and (= ~a$w_buff0_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0)), 189#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 235#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 ~a$w_buff0~0)) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 126#P1EXITtrue, Black: 237#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0))), Black: 186#(= ~y~0 1), Black: 238#(not (= ~__unbuffered_p3_EBX~0 0))]) [2021-03-26 09:50:11,056 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 09:50:11,056 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 09:50:11,056 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 09:50:11,056 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 09:50:11,208 INFO L129 PetriNetUnfolder]: 2069/4642 cut-off events. [2021-03-26 09:50:11,208 INFO L130 PetriNetUnfolder]: For 13802/14089 co-relation queries the response was YES. [2021-03-26 09:50:11,228 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17577 conditions, 4642 events. 2069/4642 cut-off events. For 13802/14089 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 42553 event pairs, 309 based on Foata normal form. 5/4350 useless extension candidates. Maximal degree in co-relation 17537. Up to 1651 conditions per place. [2021-03-26 09:50:11,272 INFO L142 LiptonReduction]: Number of co-enabled transitions 1662 [2021-03-26 09:50:11,660 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 09:50:11,794 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 09:50:12,012 INFO L154 LiptonReduction]: Checked pairs total: 115 [2021-03-26 09:50:12,013 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 09:50:12,013 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1201 [2021-03-26 09:50:12,013 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 119 transitions, 1450 flow [2021-03-26 09:50:12,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states 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 09:50:12,014 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:50:12,014 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:50:12,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 09:50:12,014 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:50:12,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:50:12,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1198345531, now seen corresponding path program 2 times [2021-03-26 09:50:12,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:50:12,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235987359] [2021-03-26 09:50:12,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:50:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:50:12,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:12,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 09:50:12,096 INFO L142 QuantifierPusher]: treesize reduction 5, result has 89.1 percent of original size [2021-03-26 09:50:12,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 09:50:12,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:12,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 09:50:12,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:12,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 09:50:12,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:12,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:50:12,148 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 09:50:12,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235987359] [2021-03-26 09:50:12,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:50:12,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 09:50:12,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451429574] [2021-03-26 09:50:12,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 09:50:12,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:50:12,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 09:50:12,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 09:50:12,150 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 217 [2021-03-26 09:50:12,151 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 119 transitions, 1450 flow. Second operand has 7 states, 7 states have (on average 161.14285714285714) internal successors, (1128), 7 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:50:12,151 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:50:12,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 217 [2021-03-26 09:50:12,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:50:13,158 INFO L129 PetriNetUnfolder]: 3220/7152 cut-off events. [2021-03-26 09:50:13,158 INFO L130 PetriNetUnfolder]: For 22165/22801 co-relation queries the response was YES. [2021-03-26 09:50:13,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28529 conditions, 7152 events. 3220/7152 cut-off events. For 22165/22801 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 68610 event pairs, 353 based on Foata normal form. 80/6779 useless extension candidates. Maximal degree in co-relation 28487. Up to 2412 conditions per place. [2021-03-26 09:50:13,198 INFO L132 encePairwiseOnDemand]: 210/217 looper letters, 25 selfloop transitions, 23 changer transitions 9/142 dead transitions. [2021-03-26 09:50:13,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 142 transitions, 1727 flow [2021-03-26 09:50:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 09:50:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 09:50:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1150 transitions. [2021-03-26 09:50:13,202 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7570770243581304 [2021-03-26 09:50:13,202 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1150 transitions. [2021-03-26 09:50:13,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1150 transitions. [2021-03-26 09:50:13,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:50:13,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1150 transitions. [2021-03-26 09:50:13,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 164.28571428571428) internal successors, (1150), 7 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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 09:50:13,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:50:13,207 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:50:13,207 INFO L185 Difference]: Start difference. First operand has 93 places, 119 transitions, 1450 flow. Second operand 7 states and 1150 transitions. [2021-03-26 09:50:13,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 142 transitions, 1727 flow [2021-03-26 09:50:13,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 142 transitions, 1715 flow, removed 6 selfloop flow, removed 0 redundant places. [2021-03-26 09:50:13,455 INFO L241 Difference]: Finished difference. Result has 102 places, 123 transitions, 1500 flow [2021-03-26 09:50:13,455 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1417, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1500, PETRI_PLACES=102, PETRI_TRANSITIONS=123} [2021-03-26 09:50:13,455 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 40 predicate places. [2021-03-26 09:50:13,455 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:50:13,455 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 123 transitions, 1500 flow [2021-03-26 09:50:13,456 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 123 transitions, 1500 flow [2021-03-26 09:50:13,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 123 transitions, 1500 flow [2021-03-26 09:50:13,797 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][12], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 258#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd3~0 0)), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 196#(not (= 4 ~__unbuffered_cnt~0)), 139#true, Black: 259#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 260#(and (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0)), 206#(= ~z~0 1), Black: 266#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd3~0 0)), 79#P3EXITtrue, Black: 141#(= ~__unbuffered_p3_EAX~0 0), 87#L878-1true, Black: 208#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), Black: 142#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), Black: 210#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0)))), Black: 213#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), 154#true, 220#true, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), 161#true, Black: 224#(not (= 4 ~__unbuffered_cnt~0)), Black: 163#(= ~__unbuffered_p2_EAX~0 0), Black: 164#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), 232#true, Black: 171#(= ~__unbuffered_cnt~0 0), 50#L768true, Black: 174#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 52#P2EXITtrue, Black: 181#(= ~x~0 1), Black: 243#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 ~a$w_buff0~0)) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0)))), Black: 245#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0)))), Black: 247#(and (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0))), Black: 234#(and (= ~a$w_buff0_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0)), 189#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 235#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 ~a$w_buff0~0)) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 237#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0))), 126#P1EXITtrue, Black: 186#(= ~y~0 1), Black: 238#(not (= ~__unbuffered_p3_EBX~0 0))]) [2021-03-26 09:50:13,797 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 09:50:13,797 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 09:50:13,797 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 09:50:13,797 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 09:50:14,011 INFO L129 PetriNetUnfolder]: 2394/5441 cut-off events. [2021-03-26 09:50:14,011 INFO L130 PetriNetUnfolder]: For 18111/18534 co-relation queries the response was YES. [2021-03-26 09:50:14,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21747 conditions, 5441 events. 2394/5441 cut-off events. For 18111/18534 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 51981 event pairs, 258 based on Foata normal form. 19/5097 useless extension candidates. Maximal degree in co-relation 21702. Up to 2060 conditions per place. [2021-03-26 09:50:14,085 INFO L142 LiptonReduction]: Number of co-enabled transitions 1838 [2021-03-26 09:50:14,667 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 09:50:14,820 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 09:50:15,595 INFO L154 LiptonReduction]: Checked pairs total: 27 [2021-03-26 09:50:15,595 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:50:15,596 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2141 [2021-03-26 09:50:15,596 INFO L480 AbstractCegarLoop]: Abstraction has has 102 places, 123 transitions, 1506 flow [2021-03-26 09:50:15,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 161.14285714285714) internal successors, (1128), 7 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:50:15,597 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:50:15,597 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:50:15,597 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 09:50:15,597 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:50:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:50:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1480017979, now seen corresponding path program 3 times [2021-03-26 09:50:15,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:50:15,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876713600] [2021-03-26 09:50:15,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:50:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:50:15,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:15,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:50:15,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:15,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:50:15,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:15,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:50:15,724 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-26 09:50:15,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 09:50:15,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:15,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:50:15,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:15,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:50:15,735 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 09:50:15,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876713600] [2021-03-26 09:50:15,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:50:15,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 09:50:15,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309478842] [2021-03-26 09:50:15,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 09:50:15,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:50:15,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 09:50:15,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 09:50:15,738 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 218 [2021-03-26 09:50:15,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 123 transitions, 1506 flow. Second operand has 7 states, 7 states have (on average 180.85714285714286) internal successors, (1266), 7 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states 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 09:50:15,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:50:15,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 218 [2021-03-26 09:50:15,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:50:15,966 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1094] L831-->L847: Formula: (let ((.cse25 (= (mod v_~a$r_buff1_thd4~0_179 256) 0)) (.cse31 (= (mod v_~a$w_buff1_used~0_396 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_226 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_395 256) 0)) (.cse13 (and .cse31 .cse6)) (.cse8 (and .cse25 .cse6)) (.cse30 (= 0 (mod v_~a$w_buff0_used~0_480 256))) (.cse28 (not .cse25)) (.cse3 (not .cse6)) (.cse9 (= (mod v_~a$w_buff0_used~0_479 256) 0))) (let ((.cse4 (or .cse6 .cse9)) (.cse14 (or (not .cse31) .cse3)) (.cse1 (or .cse3 .cse28)) (.cse19 (or .cse30 .cse6)) (.cse18 (not .cse30)) (.cse17 (or .cse30 .cse13 .cse8)) (.cse2 (not .cse7)) (.cse5 (not .cse9)) (.cse11 (not .cse0))) (and (let ((.cse10 (= |v_P3_#t~ite39_57| |v_P3Thread1of1ForFork0_#t~ite39_1|))) (or (and .cse0 (or (and .cse1 (= |v_P3_#t~ite39_57| |v_P3_#t~ite40_45|) (or .cse2 .cse3) (or (and (= |v_P3_#t~ite39_57| v_~a$r_buff0_thd4~0_226) .cse4) (and (= |v_P3_#t~ite39_57| 0) .cse3 .cse5)) .cse5) (and (or (and .cse6 .cse7) .cse8 .cse9) (= |v_P3_#t~ite40_45| v_~a$r_buff0_thd4~0_226) .cse10)) (= |v_P3_#t~ite40_45| v_~a$r_buff0_thd4~0_225)) (and (= |v_P3_#t~ite40_45| |v_P3Thread1of1ForFork0_#t~ite40_1|) .cse10 .cse11 (= v_~a$r_buff0_thd4~0_226 v_~a$r_buff0_thd4~0_225)))) (let ((.cse12 (= |v_P3_#t~ite36_53| |v_P3Thread1of1ForFork0_#t~ite36_1|))) (or (and (= |v_P3_#t~ite37_47| |v_P3Thread1of1ForFork0_#t~ite37_1|) (= v_~a$w_buff1_used~0_396 v_~a$w_buff1_used~0_395) .cse11 .cse12) (and (or (and (or .cse13 .cse8 .cse9) (= |v_P3_#t~ite37_47| v_~a$w_buff1_used~0_396) .cse12) (and .cse14 .cse1 (let ((.cse15 (= |v_P3_#t~ite36_53| 0))) (or (and .cse15 .cse4) (and .cse15 .cse3 .cse5))) (= |v_P3_#t~ite36_53| |v_P3_#t~ite37_47|) .cse5)) .cse0 (= |v_P3_#t~ite37_47| v_~a$w_buff1_used~0_395)))) (let ((.cse16 (= |v_P3_#t~ite33_63| |v_P3Thread1of1ForFork0_#t~ite33_1|))) (or (and .cse16 (= v_~a$w_buff0_used~0_479 v_~a$w_buff0_used~0_480) .cse11 (= |v_P3_#t~ite34_51| |v_P3Thread1of1ForFork0_#t~ite34_1|)) (and (or (and (= |v_P3_#t~ite34_51| v_~a$w_buff0_used~0_480) .cse16 .cse17) (and .cse14 .cse1 (= |v_P3_#t~ite33_63| |v_P3_#t~ite34_51|) .cse18 (or (and .cse18 .cse3 (= |v_P3_#t~ite33_63| 0)) (and (= |v_P3_#t~ite33_63| v_~a$w_buff0_used~0_480) .cse19)))) .cse0 (= |v_P3_#t~ite34_51| v_~a$w_buff0_used~0_479)))) (= v_~a~0_180 v_~a$mem_tmp~0_28) (or (and (= v_~a~0_178 v_~a$mem_tmp~0_28) .cse11) (and .cse0 (= v_~a~0_178 v_~__unbuffered_p3_EBX~0_14))) (let ((.cse20 (= |v_P3Thread1of1ForFork0_#t~ite30_1| |v_P3_#t~ite30_49|))) (or (and (= |v_P3Thread1of1ForFork0_#t~ite31_1| |v_P3_#t~ite31_37|) (= v_~a$w_buff1~0_121 v_~a$w_buff1~0_120) .cse11 .cse20) (and .cse0 (or (and .cse14 .cse1 (= |v_P3_#t~ite30_49| |v_P3_#t~ite31_37|) .cse18 (let ((.cse21 (= |v_P3_#t~ite30_49| v_~a$w_buff1~0_121))) (or (and .cse19 .cse21) (and .cse18 .cse3 .cse21)))) (and .cse17 .cse20 (= |v_P3_#t~ite31_37| v_~a$w_buff1~0_121))) (= |v_P3_#t~ite31_37| v_~a$w_buff1~0_120)))) (let ((.cse22 (= |v_P3_#t~ite27_47| |v_P3Thread1of1ForFork0_#t~ite27_1|))) (or (and .cse22 (= |v_P3_#t~ite28_41| |v_P3Thread1of1ForFork0_#t~ite28_1|) (= v_~a$w_buff0~0_102 v_~a$w_buff0~0_101) .cse11) (and (= |v_P3_#t~ite28_41| v_~a$w_buff0~0_101) .cse0 (or (and .cse22 .cse17 (= |v_P3_#t~ite28_41| v_~a$w_buff0~0_102)) (and .cse14 (let ((.cse23 (= |v_P3_#t~ite27_47| v_~a$w_buff0~0_102))) (or (and .cse23 .cse18 .cse3) (and .cse23 .cse19))) .cse1 .cse18 (= |v_P3_#t~ite27_47| |v_P3_#t~ite28_41|)))))) (= v_~a$flush_delayed~0_44 0) (= |v_P3Thread1of1ForFork0_#t~nondet23_1| v_~weak$$choice0~0_19) (or (and .cse14 .cse1 .cse18 (or (and .cse19 (= |v_P3_#t~ite25_53| v_~a$w_buff1~0_121)) (and (= |v_P3_#t~ite25_53| v_~a$w_buff0~0_102) .cse18 .cse3)) (= |v_P3_#t~ite25_53| v_~__unbuffered_p3_EBX~0_14)) (and .cse17 (= v_~a~0_180 v_~__unbuffered_p3_EBX~0_14) (= |v_P3_#t~ite25_53| |v_P3Thread1of1ForFork0_#t~ite25_1|))) (let ((.cse26 (= |v_P3_#t~ite42_53| |v_P3Thread1of1ForFork0_#t~ite42_1|))) (or (and .cse0 (= |v_P3_#t~ite43_43| v_~a$r_buff1_thd4~0_178) (let ((.cse24 (= (mod v_~a$r_buff0_thd4~0_225 256) 0))) (or (and (or (and .cse24 .cse7) .cse9 (and .cse25 .cse24)) (= |v_P3_#t~ite43_43| v_~a$r_buff1_thd4~0_179) .cse26) (let ((.cse27 (not .cse24))) (and (or .cse27 .cse28) (let ((.cse29 (= |v_P3_#t~ite42_53| 0))) (or (and .cse27 .cse29 .cse5) (and .cse29 (or .cse9 .cse24)))) (or .cse27 .cse2) (= |v_P3_#t~ite42_53| |v_P3_#t~ite43_43|) .cse5))))) (and .cse26 (= |v_P3_#t~ite43_43| |v_P3Thread1of1ForFork0_#t~ite43_1|) (= v_~a$r_buff1_thd4~0_178 v_~a$r_buff1_thd4~0_179) .cse11))) (= |v_P3Thread1of1ForFork0_#t~nondet24_1| v_~weak$$choice2~0_84))))) InVars {P3Thread1of1ForFork0_#t~ite42=|v_P3Thread1of1ForFork0_#t~ite42_1|, P3Thread1of1ForFork0_#t~ite30=|v_P3Thread1of1ForFork0_#t~ite30_1|, P3Thread1of1ForFork0_#t~ite43=|v_P3Thread1of1ForFork0_#t~ite43_1|, P3Thread1of1ForFork0_#t~ite40=|v_P3Thread1of1ForFork0_#t~ite40_1|, P3Thread1of1ForFork0_#t~nondet24=|v_P3Thread1of1ForFork0_#t~nondet24_1|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_179, P3Thread1of1ForFork0_#t~nondet23=|v_P3Thread1of1ForFork0_#t~nondet23_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_480, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_226, ~a~0=v_~a~0_180, ~a$w_buff1~0=v_~a$w_buff1~0_121, ~a$w_buff0~0=v_~a$w_buff0~0_102, P3Thread1of1ForFork0_#t~ite39=|v_P3Thread1of1ForFork0_#t~ite39_1|, P3Thread1of1ForFork0_#t~ite28=|v_P3Thread1of1ForFork0_#t~ite28_1|, P3Thread1of1ForFork0_#t~ite27=|v_P3Thread1of1ForFork0_#t~ite27_1|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_1|, P3Thread1of1ForFork0_#t~ite36=|v_P3Thread1of1ForFork0_#t~ite36_1|, P3Thread1of1ForFork0_#t~ite25=|v_P3Thread1of1ForFork0_#t~ite25_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_396, P3Thread1of1ForFork0_#t~ite34=|v_P3Thread1of1ForFork0_#t~ite34_1|, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_1|, P3Thread1of1ForFork0_#t~ite31=|v_P3Thread1of1ForFork0_#t~ite31_1|} OutVars{P3Thread1of1ForFork0_#t~ite30=|v_P3Thread1of1ForFork0_#t~ite30_2|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_178, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_225, ~a~0=v_~a~0_178, ~a$mem_tmp~0=v_~a$mem_tmp~0_28, ~a$w_buff1~0=v_~a$w_buff1~0_120, P3Thread1of1ForFork0_#t~ite39=|v_P3Thread1of1ForFork0_#t~ite39_2|, P3Thread1of1ForFork0_#t~ite38=|v_P3Thread1of1ForFork0_#t~ite38_1|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_2|, P3Thread1of1ForFork0_#t~ite36=|v_P3Thread1of1ForFork0_#t~ite36_2|, P3Thread1of1ForFork0_#t~ite35=|v_P3Thread1of1ForFork0_#t~ite35_1|, P3Thread1of1ForFork0_#t~ite34=|v_P3Thread1of1ForFork0_#t~ite34_2|, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_2|, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_1|, P3Thread1of1ForFork0_#t~ite31=|v_P3Thread1of1ForFork0_#t~ite31_2|, P3Thread1of1ForFork0_#t~ite42=|v_P3Thread1of1ForFork0_#t~ite42_2|, P3Thread1of1ForFork0_#t~ite41=|v_P3Thread1of1ForFork0_#t~ite41_1|, P3Thread1of1ForFork0_#t~ite43=|v_P3Thread1of1ForFork0_#t~ite43_2|, P3Thread1of1ForFork0_#t~ite40=|v_P3Thread1of1ForFork0_#t~ite40_2|, P3Thread1of1ForFork0_#t~ite44=|v_P3Thread1of1ForFork0_#t~ite44_1|, P3Thread1of1ForFork0_#t~ite45=|v_P3Thread1of1ForFork0_#t~ite45_1|, P3Thread1of1ForFork0_#t~nondet24=|v_P3Thread1of1ForFork0_#t~nondet24_2|, P3Thread1of1ForFork0_#t~nondet23=|v_P3Thread1of1ForFork0_#t~nondet23_2|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_479, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~a$flush_delayed~0=v_~a$flush_delayed~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_101, P3Thread1of1ForFork0_#t~ite29=|v_P3Thread1of1ForFork0_#t~ite29_1|, P3Thread1of1ForFork0_#t~ite28=|v_P3Thread1of1ForFork0_#t~ite28_2|, P3Thread1of1ForFork0_#t~ite27=|v_P3Thread1of1ForFork0_#t~ite27_2|, P3Thread1of1ForFork0_#t~ite26=|v_P3Thread1of1ForFork0_#t~ite26_1|, P3Thread1of1ForFork0_#t~ite25=|v_P3Thread1of1ForFork0_#t~ite25_2|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_395, ~weak$$choice2~0=v_~weak$$choice2~0_84} AuxVars[|v_P3_#t~ite28_41|, |v_P3_#t~ite42_53|, |v_P3_#t~ite43_43|, |v_P3_#t~ite27_47|, |v_P3_#t~ite31_37|, |v_P3_#t~ite25_53|, |v_P3_#t~ite30_49|, |v_P3_#t~ite33_63|, |v_P3_#t~ite37_47|, |v_P3_#t~ite34_51|, |v_P3_#t~ite36_53|, |v_P3_#t~ite40_45|, |v_P3_#t~ite39_57|] AssignedVars[P3Thread1of1ForFork0_#t~ite30, ~a$r_buff1_thd4~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~a$w_buff1~0, P3Thread1of1ForFork0_#t~ite39, P3Thread1of1ForFork0_#t~ite38, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#t~ite36, P3Thread1of1ForFork0_#t~ite35, P3Thread1of1ForFork0_#t~ite34, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32, P3Thread1of1ForFork0_#t~ite31, P3Thread1of1ForFork0_#t~ite42, P3Thread1of1ForFork0_#t~ite41, P3Thread1of1ForFork0_#t~ite43, P3Thread1of1ForFork0_#t~ite40, P3Thread1of1ForFork0_#t~ite44, P3Thread1of1ForFork0_#t~ite45, P3Thread1of1ForFork0_#t~nondet24, P3Thread1of1ForFork0_#t~nondet23, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~weak$$choice0~0, ~a$flush_delayed~0, ~a$w_buff0~0, P3Thread1of1ForFork0_#t~ite29, P3Thread1of1ForFork0_#t~ite28, P3Thread1of1ForFork0_#t~ite27, P3Thread1of1ForFork0_#t~ite26, P3Thread1of1ForFork0_#t~ite25, ~a$w_buff1_used~0, ~weak$$choice2~0][100], [Black: 189#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 68#L785true, P0Thread1of1ForFork1InUse, 264#(and (= ~a$r_buff1_thd3~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), 139#true, Black: 259#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 260#(and (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0)), 206#(= ~z~0 1), Black: 266#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd3~0 0)), 273#(= ~__unbuffered_cnt~0 0), Black: 141#(= ~__unbuffered_p3_EAX~0 0), 87#L878-1true, Black: 208#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), Black: 142#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), Black: 210#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0)))), 25#L847true, 154#true, Black: 213#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), 222#(= ~__unbuffered_cnt~0 0), 31#L818true, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), 161#true, Black: 224#(not (= 4 ~__unbuffered_cnt~0)), Black: 163#(= ~__unbuffered_p2_EAX~0 0), 232#true, Black: 164#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), 114#L775true, Black: 174#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 181#(= ~x~0 1), Black: 243#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 ~a$w_buff0~0)) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0)))), Black: 245#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0)))), 186#(= ~y~0 1), Black: 247#(and (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0))), Black: 234#(and (= ~a$w_buff0_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 235#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 ~a$w_buff0~0)) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 237#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0))), Black: 238#(not (= ~__unbuffered_p3_EBX~0 0))]) [2021-03-26 09:50:15,966 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-26 09:50:15,966 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 09:50:15,966 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 09:50:15,966 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-26 09:50:16,049 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1094] L831-->L847: Formula: (let ((.cse25 (= (mod v_~a$r_buff1_thd4~0_179 256) 0)) (.cse31 (= (mod v_~a$w_buff1_used~0_396 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_226 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_395 256) 0)) (.cse13 (and .cse31 .cse6)) (.cse8 (and .cse25 .cse6)) (.cse30 (= 0 (mod v_~a$w_buff0_used~0_480 256))) (.cse28 (not .cse25)) (.cse3 (not .cse6)) (.cse9 (= (mod v_~a$w_buff0_used~0_479 256) 0))) (let ((.cse4 (or .cse6 .cse9)) (.cse14 (or (not .cse31) .cse3)) (.cse1 (or .cse3 .cse28)) (.cse19 (or .cse30 .cse6)) (.cse18 (not .cse30)) (.cse17 (or .cse30 .cse13 .cse8)) (.cse2 (not .cse7)) (.cse5 (not .cse9)) (.cse11 (not .cse0))) (and (let ((.cse10 (= |v_P3_#t~ite39_57| |v_P3Thread1of1ForFork0_#t~ite39_1|))) (or (and .cse0 (or (and .cse1 (= |v_P3_#t~ite39_57| |v_P3_#t~ite40_45|) (or .cse2 .cse3) (or (and (= |v_P3_#t~ite39_57| v_~a$r_buff0_thd4~0_226) .cse4) (and (= |v_P3_#t~ite39_57| 0) .cse3 .cse5)) .cse5) (and (or (and .cse6 .cse7) .cse8 .cse9) (= |v_P3_#t~ite40_45| v_~a$r_buff0_thd4~0_226) .cse10)) (= |v_P3_#t~ite40_45| v_~a$r_buff0_thd4~0_225)) (and (= |v_P3_#t~ite40_45| |v_P3Thread1of1ForFork0_#t~ite40_1|) .cse10 .cse11 (= v_~a$r_buff0_thd4~0_226 v_~a$r_buff0_thd4~0_225)))) (let ((.cse12 (= |v_P3_#t~ite36_53| |v_P3Thread1of1ForFork0_#t~ite36_1|))) (or (and (= |v_P3_#t~ite37_47| |v_P3Thread1of1ForFork0_#t~ite37_1|) (= v_~a$w_buff1_used~0_396 v_~a$w_buff1_used~0_395) .cse11 .cse12) (and (or (and (or .cse13 .cse8 .cse9) (= |v_P3_#t~ite37_47| v_~a$w_buff1_used~0_396) .cse12) (and .cse14 .cse1 (let ((.cse15 (= |v_P3_#t~ite36_53| 0))) (or (and .cse15 .cse4) (and .cse15 .cse3 .cse5))) (= |v_P3_#t~ite36_53| |v_P3_#t~ite37_47|) .cse5)) .cse0 (= |v_P3_#t~ite37_47| v_~a$w_buff1_used~0_395)))) (let ((.cse16 (= |v_P3_#t~ite33_63| |v_P3Thread1of1ForFork0_#t~ite33_1|))) (or (and .cse16 (= v_~a$w_buff0_used~0_479 v_~a$w_buff0_used~0_480) .cse11 (= |v_P3_#t~ite34_51| |v_P3Thread1of1ForFork0_#t~ite34_1|)) (and (or (and (= |v_P3_#t~ite34_51| v_~a$w_buff0_used~0_480) .cse16 .cse17) (and .cse14 .cse1 (= |v_P3_#t~ite33_63| |v_P3_#t~ite34_51|) .cse18 (or (and .cse18 .cse3 (= |v_P3_#t~ite33_63| 0)) (and (= |v_P3_#t~ite33_63| v_~a$w_buff0_used~0_480) .cse19)))) .cse0 (= |v_P3_#t~ite34_51| v_~a$w_buff0_used~0_479)))) (= v_~a~0_180 v_~a$mem_tmp~0_28) (or (and (= v_~a~0_178 v_~a$mem_tmp~0_28) .cse11) (and .cse0 (= v_~a~0_178 v_~__unbuffered_p3_EBX~0_14))) (let ((.cse20 (= |v_P3Thread1of1ForFork0_#t~ite30_1| |v_P3_#t~ite30_49|))) (or (and (= |v_P3Thread1of1ForFork0_#t~ite31_1| |v_P3_#t~ite31_37|) (= v_~a$w_buff1~0_121 v_~a$w_buff1~0_120) .cse11 .cse20) (and .cse0 (or (and .cse14 .cse1 (= |v_P3_#t~ite30_49| |v_P3_#t~ite31_37|) .cse18 (let ((.cse21 (= |v_P3_#t~ite30_49| v_~a$w_buff1~0_121))) (or (and .cse19 .cse21) (and .cse18 .cse3 .cse21)))) (and .cse17 .cse20 (= |v_P3_#t~ite31_37| v_~a$w_buff1~0_121))) (= |v_P3_#t~ite31_37| v_~a$w_buff1~0_120)))) (let ((.cse22 (= |v_P3_#t~ite27_47| |v_P3Thread1of1ForFork0_#t~ite27_1|))) (or (and .cse22 (= |v_P3_#t~ite28_41| |v_P3Thread1of1ForFork0_#t~ite28_1|) (= v_~a$w_buff0~0_102 v_~a$w_buff0~0_101) .cse11) (and (= |v_P3_#t~ite28_41| v_~a$w_buff0~0_101) .cse0 (or (and .cse22 .cse17 (= |v_P3_#t~ite28_41| v_~a$w_buff0~0_102)) (and .cse14 (let ((.cse23 (= |v_P3_#t~ite27_47| v_~a$w_buff0~0_102))) (or (and .cse23 .cse18 .cse3) (and .cse23 .cse19))) .cse1 .cse18 (= |v_P3_#t~ite27_47| |v_P3_#t~ite28_41|)))))) (= v_~a$flush_delayed~0_44 0) (= |v_P3Thread1of1ForFork0_#t~nondet23_1| v_~weak$$choice0~0_19) (or (and .cse14 .cse1 .cse18 (or (and .cse19 (= |v_P3_#t~ite25_53| v_~a$w_buff1~0_121)) (and (= |v_P3_#t~ite25_53| v_~a$w_buff0~0_102) .cse18 .cse3)) (= |v_P3_#t~ite25_53| v_~__unbuffered_p3_EBX~0_14)) (and .cse17 (= v_~a~0_180 v_~__unbuffered_p3_EBX~0_14) (= |v_P3_#t~ite25_53| |v_P3Thread1of1ForFork0_#t~ite25_1|))) (let ((.cse26 (= |v_P3_#t~ite42_53| |v_P3Thread1of1ForFork0_#t~ite42_1|))) (or (and .cse0 (= |v_P3_#t~ite43_43| v_~a$r_buff1_thd4~0_178) (let ((.cse24 (= (mod v_~a$r_buff0_thd4~0_225 256) 0))) (or (and (or (and .cse24 .cse7) .cse9 (and .cse25 .cse24)) (= |v_P3_#t~ite43_43| v_~a$r_buff1_thd4~0_179) .cse26) (let ((.cse27 (not .cse24))) (and (or .cse27 .cse28) (let ((.cse29 (= |v_P3_#t~ite42_53| 0))) (or (and .cse27 .cse29 .cse5) (and .cse29 (or .cse9 .cse24)))) (or .cse27 .cse2) (= |v_P3_#t~ite42_53| |v_P3_#t~ite43_43|) .cse5))))) (and .cse26 (= |v_P3_#t~ite43_43| |v_P3Thread1of1ForFork0_#t~ite43_1|) (= v_~a$r_buff1_thd4~0_178 v_~a$r_buff1_thd4~0_179) .cse11))) (= |v_P3Thread1of1ForFork0_#t~nondet24_1| v_~weak$$choice2~0_84))))) InVars {P3Thread1of1ForFork0_#t~ite42=|v_P3Thread1of1ForFork0_#t~ite42_1|, P3Thread1of1ForFork0_#t~ite30=|v_P3Thread1of1ForFork0_#t~ite30_1|, P3Thread1of1ForFork0_#t~ite43=|v_P3Thread1of1ForFork0_#t~ite43_1|, P3Thread1of1ForFork0_#t~ite40=|v_P3Thread1of1ForFork0_#t~ite40_1|, P3Thread1of1ForFork0_#t~nondet24=|v_P3Thread1of1ForFork0_#t~nondet24_1|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_179, P3Thread1of1ForFork0_#t~nondet23=|v_P3Thread1of1ForFork0_#t~nondet23_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_480, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_226, ~a~0=v_~a~0_180, ~a$w_buff1~0=v_~a$w_buff1~0_121, ~a$w_buff0~0=v_~a$w_buff0~0_102, P3Thread1of1ForFork0_#t~ite39=|v_P3Thread1of1ForFork0_#t~ite39_1|, P3Thread1of1ForFork0_#t~ite28=|v_P3Thread1of1ForFork0_#t~ite28_1|, P3Thread1of1ForFork0_#t~ite27=|v_P3Thread1of1ForFork0_#t~ite27_1|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_1|, P3Thread1of1ForFork0_#t~ite36=|v_P3Thread1of1ForFork0_#t~ite36_1|, P3Thread1of1ForFork0_#t~ite25=|v_P3Thread1of1ForFork0_#t~ite25_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_396, P3Thread1of1ForFork0_#t~ite34=|v_P3Thread1of1ForFork0_#t~ite34_1|, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_1|, P3Thread1of1ForFork0_#t~ite31=|v_P3Thread1of1ForFork0_#t~ite31_1|} OutVars{P3Thread1of1ForFork0_#t~ite30=|v_P3Thread1of1ForFork0_#t~ite30_2|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_178, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_225, ~a~0=v_~a~0_178, ~a$mem_tmp~0=v_~a$mem_tmp~0_28, ~a$w_buff1~0=v_~a$w_buff1~0_120, P3Thread1of1ForFork0_#t~ite39=|v_P3Thread1of1ForFork0_#t~ite39_2|, P3Thread1of1ForFork0_#t~ite38=|v_P3Thread1of1ForFork0_#t~ite38_1|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_2|, P3Thread1of1ForFork0_#t~ite36=|v_P3Thread1of1ForFork0_#t~ite36_2|, P3Thread1of1ForFork0_#t~ite35=|v_P3Thread1of1ForFork0_#t~ite35_1|, P3Thread1of1ForFork0_#t~ite34=|v_P3Thread1of1ForFork0_#t~ite34_2|, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_2|, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_1|, P3Thread1of1ForFork0_#t~ite31=|v_P3Thread1of1ForFork0_#t~ite31_2|, P3Thread1of1ForFork0_#t~ite42=|v_P3Thread1of1ForFork0_#t~ite42_2|, P3Thread1of1ForFork0_#t~ite41=|v_P3Thread1of1ForFork0_#t~ite41_1|, P3Thread1of1ForFork0_#t~ite43=|v_P3Thread1of1ForFork0_#t~ite43_2|, P3Thread1of1ForFork0_#t~ite40=|v_P3Thread1of1ForFork0_#t~ite40_2|, P3Thread1of1ForFork0_#t~ite44=|v_P3Thread1of1ForFork0_#t~ite44_1|, P3Thread1of1ForFork0_#t~ite45=|v_P3Thread1of1ForFork0_#t~ite45_1|, P3Thread1of1ForFork0_#t~nondet24=|v_P3Thread1of1ForFork0_#t~nondet24_2|, P3Thread1of1ForFork0_#t~nondet23=|v_P3Thread1of1ForFork0_#t~nondet23_2|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_479, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~a$flush_delayed~0=v_~a$flush_delayed~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_101, P3Thread1of1ForFork0_#t~ite29=|v_P3Thread1of1ForFork0_#t~ite29_1|, P3Thread1of1ForFork0_#t~ite28=|v_P3Thread1of1ForFork0_#t~ite28_2|, P3Thread1of1ForFork0_#t~ite27=|v_P3Thread1of1ForFork0_#t~ite27_2|, P3Thread1of1ForFork0_#t~ite26=|v_P3Thread1of1ForFork0_#t~ite26_1|, P3Thread1of1ForFork0_#t~ite25=|v_P3Thread1of1ForFork0_#t~ite25_2|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_395, ~weak$$choice2~0=v_~weak$$choice2~0_84} AuxVars[|v_P3_#t~ite28_41|, |v_P3_#t~ite42_53|, |v_P3_#t~ite43_43|, |v_P3_#t~ite27_47|, |v_P3_#t~ite31_37|, |v_P3_#t~ite25_53|, |v_P3_#t~ite30_49|, |v_P3_#t~ite33_63|, |v_P3_#t~ite37_47|, |v_P3_#t~ite34_51|, |v_P3_#t~ite36_53|, |v_P3_#t~ite40_45|, |v_P3_#t~ite39_57|] AssignedVars[P3Thread1of1ForFork0_#t~ite30, ~a$r_buff1_thd4~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~a$w_buff1~0, P3Thread1of1ForFork0_#t~ite39, P3Thread1of1ForFork0_#t~ite38, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#t~ite36, P3Thread1of1ForFork0_#t~ite35, P3Thread1of1ForFork0_#t~ite34, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32, P3Thread1of1ForFork0_#t~ite31, P3Thread1of1ForFork0_#t~ite42, P3Thread1of1ForFork0_#t~ite41, P3Thread1of1ForFork0_#t~ite43, P3Thread1of1ForFork0_#t~ite40, P3Thread1of1ForFork0_#t~ite44, P3Thread1of1ForFork0_#t~ite45, P3Thread1of1ForFork0_#t~nondet24, P3Thread1of1ForFork0_#t~nondet23, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~weak$$choice0~0, ~a$flush_delayed~0, ~a$w_buff0~0, P3Thread1of1ForFork0_#t~ite29, P3Thread1of1ForFork0_#t~ite28, P3Thread1of1ForFork0_#t~ite27, P3Thread1of1ForFork0_#t~ite26, P3Thread1of1ForFork0_#t~ite25, ~a$w_buff1_used~0, ~weak$$choice2~0][100], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 264#(and (= ~a$r_buff1_thd3~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 196#(not (= 4 ~__unbuffered_cnt~0)), 139#true, Black: 259#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 260#(and (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0)), 206#(= ~z~0 1), Black: 266#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd3~0 0)), 273#(= ~__unbuffered_cnt~0 0), 87#L878-1true, Black: 141#(= ~__unbuffered_p3_EAX~0 0), Black: 208#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), Black: 142#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), 25#L847true, Black: 210#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0)))), 154#true, Black: 213#(and (= ~__unbuffered_p2_EBX~0 1) (= ~z~0 1)), 222#(= ~__unbuffered_cnt~0 0), 95#L788true, 31#L818true, Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), 161#true, Black: 224#(not (= 4 ~__unbuffered_cnt~0)), Black: 163#(= ~__unbuffered_p2_EAX~0 0), 232#true, Black: 164#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0))), 114#L775true, Black: 174#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 181#(= ~x~0 1), Black: 243#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 ~a$w_buff0~0)) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0)))), Black: 245#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~x~0)))), Black: 247#(and (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0))), Black: 234#(and (= ~a$w_buff0_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0)), 189#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 235#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 ~a$w_buff0~0)) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 237#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0))), Black: 186#(= ~y~0 1), Black: 238#(not (= ~__unbuffered_p3_EBX~0 0))]) [2021-03-26 09:50:16,049 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 09:50:16,049 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 09:50:16,050 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 09:50:16,050 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 09:50:16,844 INFO L129 PetriNetUnfolder]: 5445/10202 cut-off events. [2021-03-26 09:50:16,844 INFO L130 PetriNetUnfolder]: For 27647/36629 co-relation queries the response was YES. [2021-03-26 09:50:16,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40777 conditions, 10202 events. 5445/10202 cut-off events. For 27647/36629 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 91558 event pairs, 291 based on Foata normal form. 1694/10403 useless extension candidates. Maximal degree in co-relation 40730. Up to 3749 conditions per place. [2021-03-26 09:50:16,935 INFO L132 encePairwiseOnDemand]: 210/218 looper letters, 6 selfloop transitions, 18 changer transitions 50/130 dead transitions. [2021-03-26 09:50:16,935 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 130 transitions, 1595 flow [2021-03-26 09:50:16,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 09:50:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 09:50:16,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1472 transitions. [2021-03-26 09:50:16,938 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8440366972477065 [2021-03-26 09:50:16,939 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1472 transitions. [2021-03-26 09:50:16,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1472 transitions. [2021-03-26 09:50:16,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:50:16,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1472 transitions. [2021-03-26 09:50:16,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states 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 09:50:16,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 0 states have call successors, (0), 0 states 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 09:50:16,946 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 0 states have call successors, (0), 0 states 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 09:50:16,946 INFO L185 Difference]: Start difference. First operand has 102 places, 123 transitions, 1506 flow. Second operand 8 states and 1472 transitions. [2021-03-26 09:50:16,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 130 transitions, 1595 flow [2021-03-26 09:50:17,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 130 transitions, 1546 flow, removed 14 selfloop flow, removed 5 redundant places. [2021-03-26 09:50:17,705 INFO L241 Difference]: Finished difference. Result has 107 places, 77 transitions, 773 flow [2021-03-26 09:50:17,705 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=773, PETRI_PLACES=107, PETRI_TRANSITIONS=77} [2021-03-26 09:50:17,705 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 45 predicate places. [2021-03-26 09:50:17,705 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:50:17,706 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 77 transitions, 773 flow [2021-03-26 09:50:17,706 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 77 transitions, 773 flow [2021-03-26 09:50:17,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 77 transitions, 773 flow [2021-03-26 09:50:17,858 INFO L129 PetriNetUnfolder]: 713/1754 cut-off events. [2021-03-26 09:50:17,858 INFO L130 PetriNetUnfolder]: For 4896/5208 co-relation queries the response was YES. [2021-03-26 09:50:17,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7631 conditions, 1754 events. 713/1754 cut-off events. For 4896/5208 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 14369 event pairs, 119 based on Foata normal form. 8/1663 useless extension candidates. Maximal degree in co-relation 7586. Up to 624 conditions per place. [2021-03-26 09:50:17,884 INFO L142 LiptonReduction]: Number of co-enabled transitions 1004 [2021-03-26 09:50:18,173 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 09:50:18,325 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 09:50:18,516 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-26 09:50:18,685 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 09:50:18,847 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 09:50:18,857 INFO L154 LiptonReduction]: Checked pairs total: 15 [2021-03-26 09:50:18,857 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 09:50:18,857 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1152 [2021-03-26 09:50:18,858 INFO L480 AbstractCegarLoop]: Abstraction has has 102 places, 74 transitions, 757 flow [2021-03-26 09:50:18,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 180.85714285714286) internal successors, (1266), 7 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states 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 09:50:18,859 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:50:18,859 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 09:50:18,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 09:50:18,859 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:50:18,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:50:18,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1535890138, now seen corresponding path program 1 times [2021-03-26 09:50:18,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:50:18,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415379985] [2021-03-26 09:50:18,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:50:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:50:18,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:18,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 09:50:18,947 INFO L142 QuantifierPusher]: treesize reduction 14, result has 83.1 percent of original size [2021-03-26 09:50:18,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 69 [2021-03-26 09:50:18,977 INFO L142 QuantifierPusher]: treesize reduction 8, result has 85.7 percent of original size [2021-03-26 09:50:18,979 INFO L147 QuantifierPusher]: treesize reduction 9, result has 81.3 percent of original size 39 [2021-03-26 09:50:19,008 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-03-26 09:50:19,010 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-03-26 09:50:19,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:50:19,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:50:19,043 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 09:50:19,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415379985] [2021-03-26 09:50:19,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:50:19,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 09:50:19,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989393303] [2021-03-26 09:50:19,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 09:50:19,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:50:19,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 09:50:19,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 09:50:19,045 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 220 [2021-03-26 09:50:19,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 74 transitions, 757 flow. Second operand has 7 states, 7 states have (on average 161.28571428571428) internal successors, (1129), 7 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:50:19,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:50:19,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 220 [2021-03-26 09:50:19,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:50:19,453 INFO L129 PetriNetUnfolder]: 1142/2568 cut-off events. [2021-03-26 09:50:19,453 INFO L130 PetriNetUnfolder]: For 11403/12185 co-relation queries the response was YES. [2021-03-26 09:50:19,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11350 conditions, 2568 events. 1142/2568 cut-off events. For 11403/12185 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 21673 event pairs, 151 based on Foata normal form. 65/2453 useless extension candidates. Maximal degree in co-relation 11303. Up to 853 conditions per place. [2021-03-26 09:50:19,469 INFO L132 encePairwiseOnDemand]: 214/220 looper letters, 18 selfloop transitions, 5 changer transitions 38/93 dead transitions. [2021-03-26 09:50:19,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 93 transitions, 1011 flow [2021-03-26 09:50:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 09:50:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 09:50:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 984 transitions. [2021-03-26 09:50:19,472 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7454545454545455 [2021-03-26 09:50:19,473 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 984 transitions. [2021-03-26 09:50:19,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 984 transitions. [2021-03-26 09:50:19,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:50:19,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 984 transitions. [2021-03-26 09:50:19,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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 09:50:19,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states 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 09:50:19,477 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states 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 09:50:19,477 INFO L185 Difference]: Start difference. First operand has 102 places, 74 transitions, 757 flow. Second operand 6 states and 984 transitions. [2021-03-26 09:50:19,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 93 transitions, 1011 flow [2021-03-26 09:50:19,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 93 transitions, 897 flow, removed 34 selfloop flow, removed 11 redundant places. [2021-03-26 09:50:19,556 INFO L241 Difference]: Finished difference. Result has 99 places, 49 transitions, 356 flow [2021-03-26 09:50:19,556 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=356, PETRI_PLACES=99, PETRI_TRANSITIONS=49} [2021-03-26 09:50:19,557 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 37 predicate places. [2021-03-26 09:50:19,557 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:50:19,557 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 49 transitions, 356 flow [2021-03-26 09:50:19,557 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 49 transitions, 356 flow [2021-03-26 09:50:19,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 49 transitions, 356 flow [2021-03-26 09:50:19,581 INFO L129 PetriNetUnfolder]: 134/335 cut-off events. [2021-03-26 09:50:19,581 INFO L130 PetriNetUnfolder]: For 1683/1779 co-relation queries the response was YES. [2021-03-26 09:50:19,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 335 events. 134/335 cut-off events. For 1683/1779 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1753 event pairs, 11 based on Foata normal form. 23/337 useless extension candidates. Maximal degree in co-relation 1126. Up to 109 conditions per place. [2021-03-26 09:50:19,584 INFO L142 LiptonReduction]: Number of co-enabled transitions 614 [2021-03-26 09:50:19,956 INFO L154 LiptonReduction]: Checked pairs total: 180 [2021-03-26 09:50:19,956 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 09:50:19,957 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 399 [2021-03-26 09:50:19,957 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 45 transitions, 344 flow [2021-03-26 09:50:19,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 161.28571428571428) internal successors, (1129), 7 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:50:19,957 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:50:19,957 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] [2021-03-26 09:50:19,958 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 09:50:19,958 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:50:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:50:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash 844883936, now seen corresponding path program 1 times [2021-03-26 09:50:19,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:50:19,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19630637] [2021-03-26 09:50:19,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:50:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:50:20,012 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:50:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:50:20,090 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:50:20,133 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 09:50:20,134 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 09:50:20,134 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 09:50:20,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 09:50:20 BasicIcfg [2021-03-26 09:50:20,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 09:50:20,271 INFO L168 Benchmark]: Toolchain (without parser) took 35645.15 ms. Allocated memory was 335.5 MB in the beginning and 1.0 GB in the end (delta: 696.3 MB). Free memory was 298.5 MB in the beginning and 809.9 MB in the end (delta: -511.4 MB). Peak memory consumption was 185.7 MB. Max. memory is 16.0 GB. [2021-03-26 09:50:20,272 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 335.5 MB. Free memory was 316.8 MB in the beginning and 316.8 MB in the end (delta: 70.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 09:50:20,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 561.83 ms. Allocated memory is still 335.5 MB. Free memory was 298.3 MB in the beginning and 293.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.0 GB. [2021-03-26 09:50:20,273 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.95 ms. Allocated memory is still 335.5 MB. Free memory was 293.2 MB in the beginning and 291.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:50:20,276 INFO L168 Benchmark]: Boogie Preprocessor took 48.23 ms. Allocated memory is still 335.5 MB. Free memory was 291.1 MB in the beginning and 289.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:50:20,277 INFO L168 Benchmark]: RCFGBuilder took 1922.56 ms. Allocated memory is still 335.5 MB. Free memory was 289.0 MB in the beginning and 209.9 MB in the end (delta: 79.1 MB). Peak memory consumption was 150.5 MB. Max. memory is 16.0 GB. [2021-03-26 09:50:20,277 INFO L168 Benchmark]: TraceAbstraction took 33056.11 ms. Allocated memory was 335.5 MB in the beginning and 1.0 GB in the end (delta: 696.3 MB). Free memory was 209.9 MB in the beginning and 809.9 MB in the end (delta: -600.1 MB). Peak memory consumption was 97.2 MB. Max. memory is 16.0 GB. [2021-03-26 09:50:20,280 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.59 ms. Allocated memory is still 335.5 MB. Free memory was 316.8 MB in the beginning and 316.8 MB in the end (delta: 70.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 561.83 ms. Allocated memory is still 335.5 MB. Free memory was 298.3 MB in the beginning and 293.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 51.95 ms. Allocated memory is still 335.5 MB. Free memory was 293.2 MB in the beginning and 291.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 48.23 ms. Allocated memory is still 335.5 MB. Free memory was 291.1 MB in the beginning and 289.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1922.56 ms. Allocated memory is still 335.5 MB. Free memory was 289.0 MB in the beginning and 209.9 MB in the end (delta: 79.1 MB). Peak memory consumption was 150.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 33056.11 ms. Allocated memory was 335.5 MB in the beginning and 1.0 GB in the end (delta: 696.3 MB). Free memory was 209.9 MB in the beginning and 809.9 MB in the end (delta: -600.1 MB). Peak memory consumption was 97.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3490.4ms, 127 PlacesBefore, 62 PlacesAfterwards, 116 TransitionsBefore, 50 TransitionsAfterwards, 2886 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 5647 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2256, positive: 2134, positive conditional: 2134, positive unconditional: 0, negative: 122, negative conditional: 122, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2256, positive: 2134, positive conditional: 0, positive unconditional: 2134, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2256, positive: 2134, positive conditional: 0, positive unconditional: 2134, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1734, positive: 1684, positive conditional: 0, positive unconditional: 1684, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1734, positive: 1671, positive conditional: 0, positive unconditional: 1671, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 657, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 612, negative conditional: 0, negative unconditional: 612, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2256, positive: 450, positive conditional: 0, positive unconditional: 450, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 1734, unknown conditional: 0, unknown unconditional: 1734] , Statistics on independence cache: Total cache size (in pairs): 1734, Positive cache size: 1684, Positive conditional cache size: 0, Positive unconditional cache size: 1684, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1254.2ms, 58 PlacesBefore, 46 PlacesAfterwards, 47 TransitionsBefore, 35 TransitionsAfterwards, 702 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 3042 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 646, positive: 514, positive conditional: 514, positive unconditional: 0, negative: 132, negative conditional: 132, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 646, positive: 514, positive conditional: 45, positive unconditional: 469, negative: 132, negative conditional: 4, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 646, positive: 514, positive conditional: 45, positive unconditional: 469, negative: 132, negative conditional: 4, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 186, positive: 155, positive conditional: 14, positive unconditional: 141, negative: 31, negative conditional: 1, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 186, positive: 152, positive conditional: 0, positive unconditional: 152, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 31, negative conditional: 1, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 484, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 465, negative conditional: 37, negative unconditional: 428, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 646, positive: 359, positive conditional: 31, positive unconditional: 328, negative: 101, negative conditional: 3, negative unconditional: 98, unknown: 186, unknown conditional: 15, unknown unconditional: 171] , Statistics on independence cache: Total cache size (in pairs): 1920, Positive cache size: 1839, Positive conditional cache size: 14, Positive unconditional cache size: 1825, Negative cache size: 81, Negative conditional cache size: 1, Negative unconditional cache size: 80, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1159.3ms, 55 PlacesBefore, 48 PlacesAfterwards, 40 TransitionsBefore, 37 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1230 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, positive: 109, positive conditional: 109, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 160, positive: 109, positive conditional: 0, positive unconditional: 109, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 160, positive: 109, positive conditional: 0, positive unconditional: 109, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 122, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 1944, Positive cache size: 1858, Positive conditional cache size: 14, Positive unconditional cache size: 1844, Negative cache size: 86, Negative conditional cache size: 1, Negative unconditional cache size: 85, Eliminated conditions: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1337.6ms, 50 PlacesBefore, 49 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 722 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1444 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 227, positive: 177, positive conditional: 177, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 237, positive: 177, positive conditional: 0, positive unconditional: 177, 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: 237, positive: 177, positive conditional: 0, positive unconditional: 177, 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: 21, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 237, positive: 157, positive conditional: 0, positive unconditional: 157, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 1965, Positive cache size: 1878, Positive conditional cache size: 14, Positive unconditional cache size: 1864, Negative cache size: 87, Negative conditional cache size: 1, Negative unconditional cache size: 86, Eliminated conditions: 38 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 90.4ms, 55 PlacesBefore, 55 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 860 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1095 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 157, positive: 123, positive conditional: 123, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 167, positive: 123, positive conditional: 0, positive unconditional: 123, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 167, positive: 123, positive conditional: 0, positive unconditional: 123, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 167, positive: 121, positive conditional: 0, positive unconditional: 121, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1967, Positive cache size: 1880, Positive conditional cache size: 14, Positive unconditional cache size: 1866, Negative cache size: 87, Negative conditional cache size: 1, Negative unconditional cache size: 86, Eliminated conditions: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 705.8ms, 61 PlacesBefore, 61 PlacesAfterwards, 63 TransitionsBefore, 62 TransitionsAfterwards, 1278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2407 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 398, positive: 336, positive conditional: 336, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 422, positive: 336, positive conditional: 36, positive unconditional: 300, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 422, positive: 336, positive conditional: 36, positive unconditional: 300, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 3, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 422, positive: 329, positive conditional: 33, positive unconditional: 296, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1974, Positive cache size: 1887, Positive conditional cache size: 17, Positive unconditional cache size: 1870, Negative cache size: 87, Negative conditional cache size: 1, Negative unconditional cache size: 86, Eliminated conditions: 74 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 525.8ms, 60 PlacesBefore, 60 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 682 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, positive: 81, positive conditional: 81, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, positive: 81, positive conditional: 21, positive unconditional: 60, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, positive: 81, positive conditional: 21, positive unconditional: 60, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, positive: 80, positive conditional: 21, positive unconditional: 59, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1975, Positive cache size: 1888, Positive conditional cache size: 17, Positive unconditional cache size: 1871, Negative cache size: 87, Negative conditional cache size: 1, Negative unconditional cache size: 86, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1625.5ms, 64 PlacesBefore, 64 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 944 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1427 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 257, positive: 215, positive conditional: 215, positive unconditional: 0, negative: 42, negative conditional: 42, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 265, positive: 215, positive conditional: 51, positive unconditional: 164, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 265, positive: 215, positive conditional: 51, positive unconditional: 164, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 265, positive: 211, positive conditional: 51, positive unconditional: 160, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1979, Positive cache size: 1892, Positive conditional cache size: 17, Positive unconditional cache size: 1875, Negative cache size: 87, Negative conditional cache size: 1, Negative unconditional cache size: 86, Eliminated conditions: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1927.0ms, 71 PlacesBefore, 71 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 1288 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1962 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 175, positive: 127, positive conditional: 127, 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: 175, positive: 127, positive conditional: 42, positive unconditional: 85, 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: 175, positive: 127, positive conditional: 42, positive unconditional: 85, 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: 5, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 175, positive: 123, positive conditional: 38, positive unconditional: 85, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1984, Positive cache size: 1896, Positive conditional cache size: 21, Positive unconditional cache size: 1875, Negative cache size: 88, Negative conditional cache size: 1, Negative unconditional cache size: 87, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2477.9ms, 74 PlacesBefore, 74 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1390 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2840 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 230, positive: 168, positive conditional: 168, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 290, positive: 168, positive conditional: 44, positive unconditional: 124, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 290, positive: 168, positive conditional: 44, positive unconditional: 124, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 290, positive: 164, positive conditional: 42, positive unconditional: 122, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1988, Positive cache size: 1900, Positive conditional cache size: 23, Positive unconditional cache size: 1877, Negative cache size: 88, Negative conditional cache size: 1, Negative unconditional cache size: 87, Eliminated conditions: 136 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2722.2ms, 82 PlacesBefore, 82 PlacesAfterwards, 89 TransitionsBefore, 88 TransitionsAfterwards, 1566 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 3930 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 604, positive: 526, positive conditional: 526, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 704, positive: 526, positive conditional: 379, positive unconditional: 147, negative: 178, negative conditional: 0, negative unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 704, positive: 526, positive conditional: 379, positive unconditional: 147, negative: 178, negative conditional: 0, negative unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 18, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 0, positive unconditional: 20, 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: 704, positive: 506, positive conditional: 361, positive unconditional: 145, negative: 178, negative conditional: 0, negative unconditional: 178, unknown: 20, unknown conditional: 18, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2008, Positive cache size: 1920, Positive conditional cache size: 41, Positive unconditional cache size: 1879, Negative cache size: 88, Negative conditional cache size: 1, Negative unconditional cache size: 87, Eliminated conditions: 190 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1200.3ms, 93 PlacesBefore, 93 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 1662 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 115 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 115, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 115, positive: 115, positive conditional: 44, positive unconditional: 71, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 115, positive: 115, positive conditional: 44, positive unconditional: 71, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 115, positive: 107, positive conditional: 44, positive unconditional: 63, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 2016, Positive cache size: 1928, Positive conditional cache size: 41, Positive unconditional cache size: 1887, Negative cache size: 88, Negative conditional cache size: 1, Negative unconditional cache size: 87, Eliminated conditions: 38 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2139.9ms, 102 PlacesBefore, 102 PlacesAfterwards, 123 TransitionsBefore, 123 TransitionsAfterwards, 1838 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 27 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, positive: 27, positive conditional: 12, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 12, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 1, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, positive: 24, positive conditional: 11, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2019, Positive cache size: 1931, Positive conditional cache size: 42, Positive unconditional cache size: 1889, Negative cache size: 88, Negative conditional cache size: 1, Negative unconditional cache size: 87, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1151.2ms, 107 PlacesBefore, 102 PlacesAfterwards, 77 TransitionsBefore, 74 TransitionsAfterwards, 1004 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 15 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 15, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2019, Positive cache size: 1931, Positive conditional cache size: 42, Positive unconditional cache size: 1889, Negative cache size: 88, Negative conditional cache size: 1, Negative unconditional cache size: 87, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 399.3ms, 99 PlacesBefore, 87 PlacesAfterwards, 49 TransitionsBefore, 45 TransitionsAfterwards, 614 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 180 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 120, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 120, positive: 115, positive conditional: 88, positive unconditional: 27, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 120, positive: 115, positive conditional: 88, positive unconditional: 27, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 52, positive: 49, positive conditional: 39, positive unconditional: 10, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 52, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 156, positive: 127, positive conditional: 127, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, positive: 66, positive conditional: 49, positive unconditional: 17, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 52, unknown conditional: 39, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 2071, Positive cache size: 1980, Positive conditional cache size: 81, Positive unconditional cache size: 1899, Negative cache size: 91, Negative conditional cache size: 1, Negative unconditional cache size: 90, Eliminated conditions: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t121; [L872] FCALL, FORK 0 pthread_create(&t121, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t122; [L874] FCALL, FORK 0 pthread_create(&t122, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L875] 0 pthread_t t123; [L876] FCALL, FORK 0 pthread_create(&t123, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=1, z=0] [L877] 0 pthread_t t124; [L878] FCALL, FORK 0 pthread_create(&t124, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=0, x=2, y=1, z=1] [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=0, x=2, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 32763.1ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 8541.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3595.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 131 SDtfs, 134 SDslu, 200 SDs, 0 SdLazy, 620 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 699.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 513.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1506occurred in iteration=12, InterpolantAutomatonStates: 81, 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: 44.1ms SsaConstructionTime, 498.5ms SatisfiabilityAnalysisTime, 1010.2ms InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 1942 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...